ppxscal/embedding_network huggingface dataset:
Abstract state machines capture parallel algorithms: Correction and extension
Authors: Andreas Blass, Yuri Gurevich
Venue: ACM Transactions on Computational Logic (TOCL) (2008)

We consider parallel algorithms working in sequential global time, for example, circuits or parallel random access machines (PRAMs). Parallel abstract state machines (parallel ASMs) are such parallel algorithms, and the parallel ASM thesis asserts that every parallel algorithm is behaviorally equivalent to a parallel ASM. In an earlier article, we axiomatized parallel algorithms, proved the ASM thesis, and proved that every parallel ASM satisfies the axioms. It turned out that we were too timid in formulating the axioms; they did not allow a parallel algorithm to create components on the fly. This restriction did not hinder us from proving that the usual parallel models, like circuits or PRAMs or even alternating Turing machines, satisfy the postulates. But it resulted in an error in our attempt to prove that parallel ASMs always satisfy the postulates. To correct the error, we liberalize our axioms and allow on-the-fly creation of new parallel components. We believe that the improved axioms accurately express what parallel algorithms ought to be. We prove the parallel thesis for the new, corrected notion of parallel algorithms, and we check that parallel ASMs satisfy the new axioms.
HyLearn: A Mobile Learning System for Hybrid Networks
Authors: Matthias R. Brust, Adrian Andronache, Steffen Rothkugel
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

In this paper, we introduce HyLearn, a cooperative learning system for mobile devices running on a hybrid wireless network. HyLearn deploys information to interested nodes through both fixed as well as mobile networks. Due to the mobility of nodes, an efficient approach for the ad hoc self-organization is required. For that, we apply a clustering technique that forms hierarchical structures of an otherwise homogeneous ad hoc network. This multi-hop clustering algorithm is parameterized in terms of cluster size and can therefore adapt to the mobility degree of nodes. Only local information is required to establish and maintain clusters. The algorithm is motivated based onHyLearn’s expected communication pattern.
Adding Slow-Silent Virtual Channels for Low-Power On-Chip Networks
Authors: Hiroki Matsutani, Michihiro Koibuchi, Daihan Wang, Hideharu Amano
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

In this paper, we introduce the use of slow-silent virtual channels to reduce the switching power of on-chip networks while keeping the leakage power small. Adding virtual channels to a network improves the throughput until each link bandwidth is saturated. This enables us to reduce the switching power of on-chip networks by decreasing their operating frequency and supply voltage. However, adding virtual channels increases the leakage power of routers as well as the area due to their large buffers; so the runtime power gating is applied to individual virtual channels to eliminate this problem. We evaluate the performance of slow-silent virtual channels by using real application traces, and their power consumption (switching and leakage) is evaluated based on the detailed design of a virtual-channel router placed and routed with a 90nm technology. These evaluation results show that a network with three or four virtual channels achieves the best energy efficiency in a uniform traffic. In the cases of neighboring communications, a network with two virtual channels is better than the other networks with more virtual channels, because the performance improvement from no virtual channel to two virtual channels is the largest and their frequency and supply voltage can also be reduced well in these cases.
Compensation of sinusoidal disturbance with time-varying frequency in uncertain nonlinear system using disturbance accommodation method
Authors: Dongkyoung Chwa, Ji-Wook Kwon
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

This paper presents the method for the compensation of sinusoidal disturbance with time-varying frequency in an uncertain nonlinear system. Unlike the previous works on the disturbance accommodation method which handles the sinusoidal disturbances with time-invariant frequency in nominal linear systems, the proposed method deals with the sinusoidal disturbance with time-varying frequency in uncertain nonlinear systems by modifying the previous disturbance accommodation technique. In particular, the nonlinear systems with uncertainties are considered such that the proposed disturbance compensation method can be more practically employed. The stability analysis and numerical simulations are performed to verify the proposed approach.
Hardware optimized image processing algorithms for industrial high speed applications
Authors: Jörg Velten, Marco Krips, Anton Kummert
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Industrial high speed image processing is a challenging field of application. Conflictive requirements concerning computational power and economic expenses have to be met. The present paper describes the development of hardware optimized algorithms for implementation in video based industrial safety devices, where complex production processes have to be protected. Selection of algorithms was done with respect to an optimized implementability in FPGAs.
Process Maintenance Through Component-Process Replacement
Authors: Ayesha Manzer, Ali H. Dogru
Venue: Journal of Integrated Design Process Science (2006)

An enterprise is represented by its process model that is constructed by the integration of smaller processes corresponding to value-added contributors. Replacing the sub-processes can modify the super-process. Component processes are represented in task systems in order to discover how process attributes will be preserved after integration. This approach is especially versatile if virtual enterprises are formed over the Internet through integrating the published processes of core competencies. The virtually constructed super-process can be exercised as a simulation before the real process is enacted. A final process is thus a composition of core-competency processes that is believed to yield an optimal enterprise operation. Core-competency processes from individual organizations are expected to be available to form value-added chains. Once matured, such a market of processes will offer alternatives by different organizations.
Collaboration between Security Devices toward improving Network Defense
Authors: Meharouech Sourour, Bouhoula Adel, Abbes Tarek
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Internet technologies have been applied to many areas such as tax payments, electronic auctions, electronic commerce, electronic voting; so it is very important to protect these applications and network devices from data tapped or counterfeited by malicious attackers. To guard against these malicious attacks, different network security devices are designed, such as firewalls, intrusion detection and prevention systems, vulnerability scanner, honeypot and so on. However, all these security devices can not guarantee computer systems protection because each one is implemented as a stand-alone system for solving a particular security problem and it is not designed to communicate with the others. The focus of this work is encompassing a security infrastructure where multiple security devices form a global security layer. Each component is defined with respect to the others and interacts dynamically and automatically with the different security devices.
Reorganization and discovery of grid information with epidemic tuning
Authors: Agostino Forestiero, Carlo Mastroianni, Giandomenico Spezzano
Venue: Future Generation Computer Systems (2008)

This paper examines a multi-agent approach to spatially sort and discovery information about the resources offered by a Grid. Agents, whose behavior is inspired by ant colonies, replicate and distribute resource descriptors according to the class to which the corresponding resources belong. This facilitates resource discovery operations: query messages are attracted towards hosts that store information about a large number of resources having the required characteristics. The presented reorganization and discovery protocols feature self-organization and decentralization characteristics, since operations are performed only on the basis of local information. Agents can either replicate or simply relocate resource descriptors. These two operation modes are aimed, respectively, at fostering the dissemination or the reorganization of information. The balance between these two objectives can be modulated by setting the parameter of an ant-inspired pheromone mechanism. Balance can be static, i. e., decided a priori, or dynamic, in the case that user and network requirements change with time. In the latter case, an ''epidemic'' mechanism is used to communicate the value of this parameter to the hosts and agents of the Grid. Simulation analysis confirms the effectiveness of the reorganization and discovery protocols and of the mentioned epidemic tuning mechanism.
Active scheduling for programmable routers in open adaptive network environments
Authors: S. A. Hussain
Venue: Journal of High Speed Networks (2007)

Active and Programmable networks change the functionality of intermediate nodes by using agents and active packets. This paper presents a novel packet scheduling scheme called Active Scheduling to maintain QoS in virtual private networks (VPNs) within the domain of adaptive and programmable networks. In Active Scheduling agents on the router monitor the accumulated queuing delay for each service. In order to keep the end-to-end delay within the bounds, the weights for services are adjusted dynamically by agents on the routers spanning the VPN. If there is a rise or fall in queuing delay of a service, an agent on a downstream router informs the upstream routers to alter the weights of their queues. This keeps the end-to-end delay of services within the defined bounds and offers better QoS compared to VPNs using static WFQ. The paper describes Active Scheduling, and presents simulation results and these are compared with WFQ.
Use of web service orchestration strategies in operations on digital democracy platform
Authors: Carlos González Martínez, Emilia Pérez Belleboni, Sergio Sánchez García, Ana Gómez Oliva y, Jesús Moreno Blázquez
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

Platforms of digital democracy, including both those in platforms of e-government and those operating independently, provide a channel of citizen participation enabling democratic decision-making processes. This paper presents a proposal for an e-democracy platform based on web services technology that is configurable and extensible for use in different scenarios of citizen participation. Operations that this platform must provide to applications are provided, and its breakdown in web services, with the use of service orchestration techniques to define plans for controlling the execution of services in the proper order.
Shape preserving bottom-up tree transducers
Authors: Zsolt Gazdag
Venue: Journal of Automata, Languages and Combinatorics (2005)

It is easy to observe that both top-down and bottom-up (finite state) relabelling tree transducers preserve the shape of the trees. It is known that every shape preserving top-down tree transducer is semantically equivalent to a top-down relabelling tree transducer. In this way, for top-down tree transducers, the semantic property "being shape preserving" is characterized by the syntactic property "being relabelling". In this paper we prove the analogous result for bottom-up tree transducers. Namely, we show that every shape preserving bottom-up tree transducer is equivalent to a bottom-up relabelling tree transducer. We also prove that it is decidable if two shape preserving bottom-up tree transducers are equivalent.
Crosstalk Noise Variation Assessment and Analysis for the Worst Process Corner
Authors: Jae-Seok Yang, Andrew R. Neureuther
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

As the relative levels of coupling capacitance in smaller process geometries and of process variations caused due to lithography, CMP, and Etch process increases, process variation aware coupled noise analysis is becoming more important especially at under 45nm design and below. We propose a method to simulate crosstalk noise for the worst process corner cases. Our method considers a spatial correlation for transistor length variations because the difference of the driver strength between victim and aggressor is the main source of the variation. Both lithography and CMP variation are first considered separately and combined to show crosstalk noise change for interconnect variations. We compare results for various process variation models using a crosstalk test structure. In these simulation studies, crosstalk noise without variation consideration underestimates by up to 17% the noise of the proposed worst corner model.
Fast network component analysis (FastNCA) for gene regulatory network reconstruction from microarray data
Authors: Chunqi Chang, Zhi Ding, Yeung Sam Hung, Peter Chin Wan Fung
Venue: Bioinformatics (2008)

Motivation: Recently developed network component analysis (NCA) approach is promising for gene regulatory network reconstruction from microarray data. The existing NCA algorithm is an iterative method which has two potential limitations: computational instability and multiple local solutions. The subsequently developed NCA-r algorithm with Tikhonov regularization can help solve the first issue but cannot completely handle the second one. Here we develop a novel Fast Network Component Analysis (FastNCA) algorithm which has an analytical solution that is much faster and does not have the above limitations. Results: Firstly FastNCA is compared to NCA and NCA-r using synthetic data. The reconstruction of FastNCA is more accurate than that of NCA-r and comparable to that of properly converged NCA. FastNCA is not sensitive to the correlation among the input signals, while its performance does degrade a little but not as dramatically as that of NCA. Like NCA, FastNCA is not very sensitive to small inaccuracies in a priori information on the network topology. FastNCA is about several tens times faster than NCA and several hundreds times faster than NCA-r. Then, the method is applied to real yeast cell-cycle microarray data. The activities of the estimated cell-cycle regulators by FastNCA and NCA-r are compared to the semi-quantitative results obtained independently by Lee et al. (2002). It is shown here that there is a greater agreement between the results of FastNCA and Lee's, which is represented by the ratio 23/33, than that between the results of NCA-r and Lee's, which is 14/33. Availability: Software and supplementary materials are available from http://www.eee.hku.hk/~cqchang/FastNCA.htm Contact: cqchang@eee.hku.hk
Lie powers and Witt vectors
Authors: R. M. Bryant, Marianne Johnson
Venue: Journal of Algebraic Combinatorics: An International Journal (2008)

In the study of Lie powers of a module V in prime characteristic p, a basic role is played by certain modules B n introduced by Bryant and Schocker. The isomorphism types of the B n are not fully understood, but these modules fall into infinite families $\{B_{k},B_{pk},B_{p^{2}k},\dots \}$ , one family B(k) for each positive integer k not divisible by p, and there is a recursive formula for the modules within B(k). Here we use combinatorial methods and Witt vectors to show that each module in B(k) is isomorphic to a direct sum of tensor products of direct summands of the kth tensor power V ¿ k .
Wi-Fi Network Signals as a Source of Digital Evidence: Wireless Network Forensics
Authors: Benjamin Turnbull, Jill Slay
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

802.11-based wireless networking has significantly altered the networking means and topology for cities, offices, homes and coffee shops over the last five years. A second generation of wireless devices has extended what was once a computer-to-computer protocol into the area of embedded functional devices. Accompanying this widespread usage is the presence of crime; the more popular technology, the more opportunity exists for its misuse. This work studies the 802.11-based wireless networking environment from a forensic computing perspective. It seeks to understand the current state of wireless misuse: present misuses; potential forms of misuse involving 802.11-based wireless networks; and current tools and techniques used in its identification, containment and analysis. The research highlights the lack of current tools and procedures for forensic computing investigations that are able to effectively handle the presence of wireless devices and networks, and that there are forms of misuse that may escape detection by forensic investigation teams.
Technology Solutions for Improving Accuracy and Availability of Healthcare Records
Authors: Robin S. Poston, Rebecca B. Reynolds, Mark L. Gillenson
Venue: Information Systems Management (2007)

Providers need access to the data in patient healthcare records to make decisions that provide the type of high-quality services, which lead to successful medical treatments. This article summarizes the data accuracy and data availability problems that exist in managing healthcare records, and then describes various technology solutions that could be designed to address specific data problems.
Octree Based Representation and Volume Rendering of Three-Dimensional Medical Data Sets
Authors: Weiwei Song, Shungang Hua, Zongying Ou, Hu An, Kaifeng Song
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In many clinical applications, interactive exploration of three dimension medical data sets is required, but the huge amount of computational time and storage space needed for rendering do not allow the visualization of large medical data sets by now. In this paper we present a new algorithm for rendering large medical data sets on standard PC. The key technique is a new representation method of large medical dataset based on an efficient octree data structure. First, the input data is converted into a compressed hierarchical octree representation. Then, a template-based raycasting scheme using shear-warp factorization for expediting parallel viewing of volume datasets is employed. The algorithm exploits the uniform shape, orientation and size of the “nonempty” octree blocks by building templates for ray/block intersections in the case of raycasting. Experiment results display that high quality human body interior images of a large dataset can be generated by the proposed approach on a standard PC platform fast.
Controversy Corner: Why and how can human-related measures support software development processes?
Authors: Orit Hazzan, Irit Hadar
Venue: Journal of Systems and Software (2008)

In this paper we discuss why and how measures related to human aspects should be incorporated into software development processes. This perspective is based on the vast evidence that human aspects are the source of the majority of problems associated with software development projects. Having said that, we do not blame the humans involved in software development processes; rather, we suggest that human-related measures might be one means by which human aspects of software development processes can be supported.
Practical Combinatorial Testing: Beyond Pairwise
Authors: Rick Kuhn, Yu Lei, Raghu Kacker
Venue: IT Professional (2008)

Many software developers have encountered failures that occur only as the result of an interaction between two components. For example, a Web application might work correctly on Linux/Apache or Windows/IIS platforms but fail when run on a Windows XP box running an Apache server. The application error is triggered by an interaction of two components: the operating system and the Web server. Testers often use pairwise testing—all pairs of parameter values—to detect such interactions. Combinatorial testing beyond pairwise is rarely used because good algorithms for higher strength combinations, such as four-way or more, have not been available. Nevertheless, empirical evidence shows that some errors are triggered only by the interaction of three, four, or more parameters. With new algorithms and tools, developers can apply high-strength combinatorial testing capable of detecting these elusive errors.
Free and fixed end-point optimal control problems for linear systems with exogenous variables
Authors: Corneliu Botan, Florin Ostafi, Alexandru Onea
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

A comparison between the fixed end free end-point optimal control problems is performed. The problems refer to a quadratic criterion and a linear system with exogenous variables. A symmetrical algorithm for both problems is presented. This algorithm can be easier implemented by comparison with classical procedures.
Investigation of Smoothness-Increasing Accuracy-Conserving Filters for Improving Streamline Integration through Discontinuous Fields
Authors: Michael Steffen, Sean Curtis, Robert M. Kirby, Jennifer K. Ryan
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Streamline integration of fields produced by computational fluid mechanics simulations is a commonly used tool for the investigation and analysis of fluid flow phenomena. Integration is often accomplished through the application of ordinary differential equation (ODE) integrators -- integrators whose error characteristics are predicated on the smoothness of the field through which the streamline is being integrated -- smoothness which is not available at the inter-element level of finite volume and finite element data. Adaptive error control techniques are often used to ameliorate the challenge posed by inter-element discontinuities. As the root of the difficulties is the discontinuous nature of the data, we present a complementary approach of applying smoothness-enhancing accuracy-conserving filters to the data prior to streamline integration. We investigate whether such an approach applied to uniform quadrilateral discontinuous Galerkin (high-order finite volume) data can be used to augment current adaptive error control approaches. We discuss and demonstrate through numerical example the computational trade-offs exhibited when one applies such a strategy.