ppxscal/embedding_network huggingface dataset:
On the Security of Beth's Identification Schemes against Active and Concurrent Adversaries
Authors: Giovanni Crescenzo
Venue: Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth (2008)

One of the earliest identification schemes was proposed by Beth in [6]. Since its introduction, variations and generalizations of this scheme have been considered, and, recently, the property of security against passive impersonation was shown, under a weak unforgeability assumption on the hashed El Gamal signature scheme, for two such variants: one in the standard (i.e., not identity-based) and one in the identity-based model. However, the security of both protocols under active and concurrent impersonation attacks was left open.In this paper we prove that very minor modifications to these schemes result in schemes that satisfy security under active and concurrent impersonation attacks, assuming a one-more-dlog assumption. The resulting protocols are just as efficient as the original variants, which are, in turn, somewhat more efficient (but less general) of the original one proposed by Beth.
Simulation of in-patient mobility in hospitals
Authors: Ivan Krivy
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

This paper concerns modeling and simulation of in-patient movements in hospitals. It provides a formalized view of in-patient departments, their structure and rules of patient movements. Computer representation of the formalized view is implemented in super-object oriented SIMULA language to make a simulation program, which can be used not only during the design of in-patient department systems but also during their operation for making short-time decisions.
Do Software Engineers Like Multimedia?
Authors: Masahito Hirakawa
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Multimedia is not a dream anymore. Nowadays we use images (e.g., GIF, JPEG, and BMP), videos (e.g., MPEG, AVI, and QuickTime), and sounds (e.g., MIDI and WAV) as well as alphanumerical information even on a personal computer. People whose research topics relate to computer network, operating system, real-time computing, user interface/HCI, or consumer products have been very active in developing multimedia tools/systems/products, including high speed network, ATM, video servers, streaming video, push technology, computer games, CD-ROM titles, and so on. But how about software engineers? It seems that they are not interested in multimedia. Why? Is software engineering independent from multimedia? I should say no. In this paper, we present a personal view about this point and related topics which includes multimedia software engineering.
A soft computing approach to localization in wireless sensor networks
Authors: Sukhyun Yun, Jaehun Lee, Wooyong Chung, Euntai Kim, Soohan Kim
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper, we propose two intelligent localization schemes for wireless sensor networks (WSNs). The two schemes introduced in this paper exhibit range-free localization, which utilize the received signal strength (RSS) from the anchor nodes. Soft computing plays a crucial role in both schemes. In the first scheme, we consider the edge weight of each anchor node separately and combine them to compute the location of sensor nodes. The edge weights are modeled by the fuzzy logic system (FLS) and optimized by the genetic algorithm (GA). In the second scheme, we consider the localization as a single problem and approximate the entire sensor location mapping from the anchor node signals by a neural network (NN). The simulation and experimental results demonstrate the effectiveness of the proposed schemes by comparing them with the previous methods.
A Study on PSO-Based University Course Timetabling Problem
Authors: Sheau Fen Ho Irene, Safaai Deris, Mohd Hashim Siti Zaiton
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In university timetabling problems, course subjects must be assigned to a certain timeslots and rooms that satisfy preferred constraints. Timetabling problem is NP-completeness problem, which is a difficult problem with a lot of constraints to be solved and a huge search space needed to be explored if the problem size increases. As Particle Swarm Optimization (PSO) has many successful applications in continuous optimization problems, the main contribution of this paper is to utilize PSO to solve the discrete problem of University Course Timetable (UCT). Experimental results confirm that PSO able to solve the timetabling problem with promising result.
Virus spread in networks
Authors: Piet Van Mieghem, Jasmina Omic, Robert Kooij
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

The influence of the network characteristics on the virus spread is analyzed in a new--the N-intertwined Markov chain--model, whose only approximation lies in the application of mean field theory. The mean field approximation is quantified in detail. The N-intertwined model has been compared with the exact 2N-state Markov model and with previously proposed "homogeneous" or "local" models. The sharp epidemic threshold τc, which is a consequence of mean field theory, is rigorously shown to be equal to τc = 1/(λmax (A)), where λmax (A) is the largest eigenvalue--the spectral radius--of the adjacency matrix A. A continued fraction expansion of the steady-state infection probability at node j is presented as well as several upper bounds.
Numerical Approximation of Partial Differential Equations, 1st ed. 1994. 2nd printing edition
Authors: Alfio M. Quarteroni, Alberto Valli
Venue:  (2008)

This is the softcover reprint of the very popular hardcover edition. This book deals with the numerical approximation of partial differential equations. Its scope is to provide a thorough illustration of numerical methods, carry out their stability and convergence analysis, derive error bounds, and discuss the algorithmic aspects relative to their implementation. A sound balancing of theoretical analysis, description of algorithms and discussion of applications is one of its main features. Many kinds of problems are addressed. A comprehensive theory of Galerkin method and its variants, as well as that of collocation methods, are developed for the spatial discretization. These theories are then specified to two numerical subspace realizations of remarkable interest: the finite element method and the spectral method.
Advances in Cognitive Neurodynamics ICCN 2007: Proceedings of the International Conference on Cognitive Neurodynamics. ICCN 2007 Proceedings, 1st edition
Authors: Rubin Wang, Fanji Gu, Enhua Shen
Venue:  (2008)

This volume contains the Proceedings of the 1st International Conference on Cognitive Neurodynamics held in Shanghai, November 17-21, 2007. The participants were treated to an exciting and stimulating conference that left everyone with an enthusiastic vision for the future of the field. The latest important progress was covered by 13 mini-symposia including: Models of Mental Disorders; Cognitive Machines; Dynamics in learning and memory; Central nervous system synchronization; Neuroinformatics; Cognitive Computational Modeling of Human Language Processing; Cognitive Neurodynamics of Attention; Bottom-Up and Top-Down; Brain Networks; From Anatomy to Dynamics; Translational Cognitive Neuroimaging; K-sets; Theory and Applications; Advanced Signal Processing Techniques for Brain Data Analysis; Visual cortex: information processing and dynamics; Dynamics of Firing Patterns and Synchronization in Neuronal Systems.
A heuristic approach for the max-min diversity problem based on max-clique
Authors: Federico Della Croce, Andrea Grosso, Marco Locatelli
Venue: Computers and Operations Research (2009)

In this paper we discuss a heuristic approach for the solution to the max-min diversity problem. The approach relies on the equivalence between this problem and the classical max-clique: it solves different decision problems about the existence of cliques with a given size. The idea is rather simple but, according to the experiments and the comparison with the existing literature, appears as particularly promising and outperforms, both in quality and CPU time, the existing state of the art algorithms.
Body Area Sensor Networks: Challenges and Opportunities
Authors: Mark A. Hanson, Harry C. Powell Jr., Adam T. Barth, Kyle Ringgenberg, Benton H. Calhoun, James H. Aylor, John Lach
Venue: Computer (2009)

Body area sensors can enable novel applications in and beyond healthcare, but research must address obstacles such as size, cost, compatibility, and perceived value before networks that use such sensors can become widespread.
Controlling the Rates and Achieving the Capacity Region for Two Sources Two Sinks Network Coding
Authors: Rami S. Youail, Cheng Wenqing, Huang Jiaqing, Tao Shaoguo
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Network coding offers new capabilities for efficient information multicasting in communication networks to maximize network throughput. In this paper we address optimal network coding scheme for two source two sinks multicast network. The main contribution of this work is to achieve the outer bound on capacity of network coding for two source two sink network by decomposing the multicast problem into three sub-problems: a multicast network coding sub-problem and two multi-commodity flow sub-problems. We also address the problem of achieving rates that maximize the total receiver throughput for multirate multicast session. The proposed method is a tree-based in which each source has one or more multicast tree to all the receivers.
An algorithm for clock synchronization with the gradient property in sensor networks
Authors: Rodolfo M. Pussente, Valmir C. Barbosa
Venue: Journal of Parallel and Distributed Computing (2009)

We introduce a distributed algorithm for clock synchronization in sensor networks. Our algorithm assumes that nodes in the network only know their immediate neighborhoods and an upper bound on the network's diameter. Clock-synchronization messages are only sent as part of the communication-assumed to be reasonably frequent-that already takes place among nodes. The algorithm has the gradient property of [R. Fan, N. Lynch, Gradient clock synchronization, Distributed Computing 18 (2006) 255-266], achieving an O(1) worst-case skew between the logical clocks of neighbors. The algorithm's actions are such that no constant lower bound exists on the rate at which logical clocks progress in time, and for this reason the lower bound of [R. Fan, N. Lynch, Gradient clock synchronization, Distributed Computing 18 (2006) 255-266; L. Meier, L. Thiele, Brief announcement: Gradient clock synchronization in sensor networks, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005, p. 238] that forbids a constant clock skew between neighbors does not apply.
Protection Profile for Connected Interoperable DRM Framework
Authors: Donghyun Choi, Sungkyu Cho, Dongho Won, Seungjoo Kim
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

Nowadays, interoperability of DRM is an issue in market. It can be achieved by three different approaches: full-format, configuration-driven and connected interoperability. In particular, the connected interoperability refers to devices that contact an online translation service. When the consumers want to transfer content to a different device, they access the online translation server and rely upon online services. The connected interoperability does not need defining one standard and has the ability to monitor. Therefore, the connected interoperability is used more than others in market. However, in the connected interoperability, even though two distinct DRM systems want to share the content, they cannot share the content if the online translation server does not guarantee reliability. In this paper, we propose a protection profile for connected interoperable DRM framework to solve the problem. This PP can be used to establish trust between the DRM provider and the online translation server for interoperability. If that happens, the connected interoperable DRM market will be more active than before.
Real-Time Depth-of-Field Rendering Using Anisotropically Filtered Mipmap Interpolation
Authors: Sungkil Lee, Gerard Jounghyun Kim, Seungmoon Choi
Venue: IEEE Transactions on Visualization and Computer Graphics (2009)

This article presents a real-time GPU-based post-filtering method for rendering acceptable depth-of-field effects suited for virtual reality. Blurring is achieved by nonlinearly interpolating mipmap images generated from a pinhole image. Major artifacts common in the post-filtering techniques such as bilinear magnification artifact, intensity leakage, and blurring discontinuity are practically eliminated via magnification with a circular filter, anisotropic mipmapping, and smoothing of blurring degrees. The whole framework is accelerated using GPU programs for constant and scalable real-time performance required for virtual reality. We also compare our method to recent GPU-based methods in terms of image quality and rendering performance.
Off-broadside main beam design and subband implementation for a class of frequency invariant beamformers
Authors: Wei Liu, Stephan Weiss
Venue: Signal Processing (2009)

The design of frequency invariant beamformers (FIBs) with off-broadside main beams is studied and it is shown that the required FIR filter length in this case should be much larger than the one with a broadside main beam. To reduce the computational complexity of such a beamformer and also improve its frequency invariant property at lower frequencies, two subband implementations are proposed. In the first one, the fullband array signals are split into subbands by a bank of analysis filters and the corresponding decimated subband signals form a series of subband arrays. Based on this standard subband structure, we then change the sensor spacings of different subband signals so that lower frequency bands have a larger spacing, which leads to a class of FIBs with scaled aperture with further improved performance at lower frequencies.
Intelligent fuzzy multi-objective optimization: analysis and new research directions
Authors: Waiel F. Abd El-Wahed
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Multi-objectives decision making (MODM) represents an interest area of research since most real life problems have a set of conflict objectives. MODM has its roots in late-nineteenth-century welfare economics, in the works of Edgeworth and Pareto. Because of the shortcomings that faces the FMODM, it attracts the attentions of researchers to enhance the field of FMODM by developing more powerful links (bridges) between it and other sciences such as artificial intelligence. This paper presents a review of the connections between artificial intelligence and FMODM to deal with its shortcomings. Also, It indicated the new direction for more research work.
Tilted fiber Bragg grating-based single polarization Yb3+-doped fiber laser
Authors: X. P. Cheng, P. Shum, J. Q. Zhou
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

By using a zero-order-nulled phase mask, 45&deg; titled fiber Bragg gratings (TFBG) were fabricated that have a near constant polarization-dependent loss (PDL) across a wide wavelength range (1030 to 1080 nm). By integrating this high PDL tilted FBG into the ring cavity of the ytterbium-doped fiber laser, we achieved single polarization ytterbium-doped fiber laser with degree of polarization (DOP) of more than 99.86% at oscillation wavelength of 1.06 &mu;m, which is continuous tunable across 25 nm (1050 to 1075 nm).
On very true operators and υ-filters
Authors: Xuejun Liu, Zhudeng Wang
Venue: WSEAS Transactions on Mathematics (2008)

In this paper, based on Hájek, Vychodil, Rachunek and Šalounová's works, we study the concept of υ-filters of residuated lattices with weak υt-operators, axiomatize very true operators, discuss filters and υ-filters of residuated lattices with weak υt-operator, give the formulas for calculating the υ-filters generated by subsets, and show that lattice of υ-filters of a commutative residuated lattice with υt-operator is a complete Brouwerian lattice.
Applying computers in the research and development laboratory
Authors: John R. Kosorok, Russell L. Heath, Theodore H. Kehl, Edward A. Kramer, Robert E. Mahan
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

To bring about a better understanding of the needs of laboratory researchers employing small computers and the potential of these computers for meeting such needs, a panel of two computer users, a system designer and a computer manufacturer representative will address the problem. The panel will discuss: (1) electronic and electromechanical devices comprising a computer system (hardware), (2) computer programs (software), and (3) connecting circuitry linking laboratory instruments and the computer (interface).
The Application of Genetic Algorithm in Embedded System Hardware-software Partitioning
Authors: Shijue Zheng, Yan Zhang, Tingting He
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

In this paper, we use Genetic Algorithm to do the embedded system hardware-software co-design. The result indicates that the Genetic Algorithm can solve the problem of embedded system hardware-software co-design. An important task of embedded system design is to find an effective way of hardware-software implement. Since Genetic Algorithm is a very effective way to solve combination optimization problem, we use Genetic Algorithm to realize hardware-software partitioning. In order to satisfy the market factor of embedded system, this approach uses cost/performance ratio to balance the performance and the cost. We will give the model of the problem in this paper.
Palpatine: A P2MP IMS Video Share Architecture and Implementation
Authors: Luis López Fernández, Micael Gallego Carrillo, José María Recio Peláez, Francisco Javier López Fernández
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

In this paper we present Palpatine, an IMS Application Server providing a Point-to-Multi-Point video share delivery service where a Video Share capable 3G device can capture audio and video in real time and send it lively to a group of 3G terminals wishing to receive it. Palpatine integrates seamlessly into IMS infrastructures without requiring any network modification and fulfilling all required standards. For this reason, Palpatine can be directly used over any IMS-compliant network without requiring the installation of any external application on current commercial Video Share capable mobile devices.
Understanding and mitigating the effects of count to infinity in Ethernet networks
Authors: Khaled Elmeleegy, Alan L. Cox, T. S. Eugene Ng
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Ethernet's high performance, low cost, and ubiquity have made it the dominant networking technology for many application domains. Unfortunately, its distributed forwarding topology computation protocol-the Rapid Spanning Tree Pro-tocol (RSTP)-is known to suffer from a classic count-to-infinity problem. However, the cause and implications of this problem are neither documented nor understood. This paper has three main contributions. First, we identify the exact conditions under which the count-to-infinity problem manifests itself, and we characterize its effect on forwarding topology convergence. Second, we have discovered that a forwarding loop can form during count to infinity, and we provide a detailed explanation. Third, we propose a simple and effective solution called RSTP with Epochs. This solution guarantees that the forwarding topology converges in at most one round-trip time across the network and eliminates the possibility of a count-to-infinity induced forwarding loop.
A Graph-based Design Framework for Global Computing Systems
Authors: Antonio Bucchiarone, Greg Dennis, Stefania Gnesi
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We present a framework for designing and analyzing Global Computing Systems using Dynamic Software Architectures. The framework, called TGG"A, integrates typed graph grammars and the Alloy modeling language to specify Programmed Dynamic Software Architectures that represent systems that evolve their topology at runtime. We demonstrate the benefits of the framework by applying it to the study of an Automotive Software System.
Policy and Legal Challenges of VirtualWorlds and Social Network Sites
Authors: Holger M. Kienle, Andreas Lober, Hausi A. Müller
Venue: Proceedings of the 2008 Requirements Engineering and Law (2008)

This paper addresses policy challenges of complex vir- tual environments such as virtual worlds, social network sites, and massive multiplayer online games. The com- plexity of these environments--apparent by the rich user interactions and sophisticated user-generated content that they offer--poses unique challenges for policy management and compliance. These challenges are also impacting the life cycle of the software system that implements the virtual environment. The goal of this paper is to identify and sketch important legal and policy challenges of virtual environments and how they affect stakeholders (i.e., operators, users, and lawmakers). Given the increasing significance of virtual environments, we expect that tackling these challenges will become increasingly important in the future.
Note: On the simplification of infinite morphic words
Authors: Juha Honkala
Venue: Theoretical Computer Science (2009)

We study the simplification of infinite morphic words by using elementary morphisms. In particular, we give a new proof of a result of Cobham, stating that a morphic image of a morphic word is a finite word or a morphic word.
Discrete models of infectious disease spread
Authors: Petr Bulava
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper we deal with discrete models of infectious disease spread. We come out from classical continuous Kermack-McKendrick compartmental approach which is transformed into the form of discrete simulation model. Next we generalize it by defining a concept of temporal communities which every individual is incorporated into. Temporal communities are built dynamically according to living rules from individuals in various stage of infection. Proper creation on communities is ensured by formerly developed algorithms including nested simulation.
The Reliability Study of the Single Hydraulic Prop Based on Finite Element Analysis
Authors: Xin Zhang, Jianwu Zhang, Qingliang Zeng, Guoshun Sun
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

In allusion to the reliability, which exists in the parametric design and optimizing process of the single hydraulic prop, this paper presents the new method in comparison with the traditional calculating and checking method for the reliability. The geometry model of the hydraulic prop is built firstly based on the 3D software, then analyzed and optimized by the finite element software-ANSYS. Results show that the method presented for the reliability is efficient and accurate.