ppxscal/embedding_network huggingface dataset:
Plenary lecture VI: numerical algorithms for analysis and synthesis of distributed parametersystems in engineering
Authors: Ion Carstea
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

In practical engineering analysis and synthesising the best engineering solution to a given design problem are of great interest. This lecture presents numerical algorithms for analysis and synthesis of distributed-parameter systems with direct applications in electrical engineering. The algorithms are developed in the context of the finite element method both for conventional and advanced computers. Many works in the professional literature present the algorithms for analysis and synthesis of the systems described by the partial derivative equations. In our work we present a general class of distributed-parameter systems with emphasis on continuos parabolic - elliptic problems in a two-dimensional space. Optimisation methods have been efficiently developed and applied to electromagnetics and mechanics. Unfortunately, the methods developed always deal with single systems. The reality is the coupled problems exist and are complex because of the critical design parameters are in both systems. Our paper is structured in two parts: Analysis of distributed parameter systems, Synthesis of distributed parameter systems using both boundary and distributed (internal) commands. The most popular approach for the solution of an optimal control problem utilises the variational calculus for the development of necessary conditions for optimality. We consider constrained problems and Lagrange's multipliers method. Since the necessary optimality conditions are distributed, their use in the development of numerical algorithms requires that they be discretized both in space and time. The finite element method is an attractive alternative to the well-known finite difference method for numerical analysis and synthesis of many problems that arise in engineering and science. The lecture demonstrates the applicability of the finite element method to numerical simulation of the distributed parameter systems with emphasis on the engineering problems. The optimal command is found by gradient techniques for constrained problems. We use sensitivity analysis that proved to give a proper design in terms of computational efficiency. For large-scale systems we apply the domain decomposition techniques. The decomposition is guided by physical considerations in the context of the finite element method. Finally, we consider some practical examples from engineering, with emphasis on coupled models for magneto-thermal and electro-heating applications. We present some numerical experiments where we try to compute the solution of a problem with a desired level of accuracy and at the same time minimising the computational resources.
Beam-ACO Distributed Optimization Applied to Supply-Chain Management
Authors: João Caldeira, Ricardo Azevedo, Carlos A. Silva, João M. Sousa
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

The distributed optimization paradigm based on Ant Colony Optimization (ACO) is a new management technique that uses the pheromone matrix to exchange information between the different subsystems to be optimized in the supply-chain. This paper proposes the use of the hybrid algorithm Beam-ACO, that fuses Beam-Search and ACO, to implement the same management concept. The Beam-ACO algorithm is used here to optimize the supplying, the distributer and the logistic agents of the supply-chain. Further, this paper implements the concept in a software platform that allows the pheromone matrix exchange through the different agents, using the TCP/IP protocol and data base systems. The results show that the distributed optimization paradigm can still be applied on supply chains where the different agents are optimized by different algorithms and that the use of the Beam-ACO in the supplying agent improves the local and the global results of the supply chain.
N2N: A Layer Two Peer-to-Peer VPN
Authors: Luca Deri, Richard Andrews
Venue: Proceedings of the 2nd international conference on Autonomous Infrastructure, Management and Security: Resilient Networks and Services (2008)

The Internet was originally designed as a flat data network delivering a multitude of protocols and services between equal peers. Currently, after an explosive growth fostered by enormous and heterogeneous economic interests, it has become a constrained network severely enforcing client-server communication where addressing plans, packet routing, security policies and users' reachability are almost entirely managed and limited by access providers. From the user's perspective, the Internet is not an open transport system, but rather a telephony-like communication medium for content consumption.This paper describes the design and implementation of a new type of peer-to-peer virtual private network that can allow users to overcome some of these limitations. N2N users can create and manage their own secure and geographically distributed overlay network without the need for central administration, typical of most virtual private network systems.
Learning-based web query understanding
Authors: Qiang Yang
Venue:  (2007)

Web search is attracting more and more attention with the exponential increase in data becoming available on the Web. Typically, a Web user submits a short Web query consisting of a few words to a Web search system and expects the system to return the desired information. How to understand Web queries precisely and thoroughly lies at the heart of Web search. In this thesis, we study the Web query understanding problem from several viewpoints. The first one is through query topic classification, which aims at interpreting queries in terms of predefined categories based on the queries' topics. We propose three solutions for different scenarios in query topic classification. The second way of understanding queries is to detect the type of a Web query, such as whether it requires locality information or information about a person, or the like. In this thesis, we focus on personal name detection in Web queries. The third way is to construct query hierarchies from query logs. These hierarchies reflect the generalization/specification relationship among Web queries. Finally, we study the contribution of query logs to Web-page classification, which can in turn help understand Web queries. Experimental results on some real-world data sets validate the effectiveness of our proposed methods.
Modes of Real-Time Content Transformation for Web Intermediaries in Active Network
Authors: Xiang li, Jianhua Li
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Active content transformation in web is a hot topic in Internet content delivery research. In this paper, we proposed 3 different modes content transformation, which are whole-file buffering, byte-streaming, and chunk buffering. Based on the chunk dependence graph, we studied the performance for different modes and argued that the chunk streaming is the most appropriate transform model for web intermediaries based real-time content transformation.
Parliamentary websites: Theoretical and comparative perspectives
Authors: Maija Setälä, Kimmo Grönlund
Venue: Information Polity (2006)

This article analyses the potentialities of parliamentary www-sites to enhance the publicity of decision-making in representative democracies. We introduce two different models that emphasize the role of publicity in representative systems. Jeremy Bentham argued that publicity is needed to enable citizens to control the acts of the representatives. From the perspective of Kantian tradition, recently developed by the theorists of deliberative democracy, publicity is regarded as a test for the validity of the reasons given for public decisions. According to many theorists of deliberative democracy, legislative assemblies can be regarded as central forums of public deliberation in representative democracies. We analyse the contents of the parliamentary websites in 18 democratic countries and find that these contents are rather similar in established democracies across the world. We argue that parliamentary websites can be instrumental to citizens' capacity to control the representatives in the Benthamite sense, although information provided on parliamentary websites does not necessarily provide a sufficient account of all aspects of parliamentary decision-making, most notably in party groups. From the deliberative perspective, however, publicity on parliamentary websites cannot replace the role of such mediating actors as journalists, political activists and parties who "filter" and reflect upon the representatives' arguments and actions.
ICA Based Super-Resolution Face Hallucination and Recognition
Authors: Hua Yan, Ju Liu, Jiande Sun, Xinghua Sun
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

In this paper, we propose a new super-resolution face hallucination and recognition method based on Independent Component Analysis (ICA). Firstly, ICA is used to build a linear mixing relationship between high-resolution (HR) face image and independent HR source faces images. The linear mixing coefficients are retained, thus the corresponding low-resolution (LR) face image is represented by linear mixture of down-sampled source faces images. So, when the source faces images are obtained by training a set of HR face images, unconstrained least square is utilized to obtain mixing coefficients to a LR image for hallucination and recognition. Experiments show that the accuracy of face recognition is insensitive to image size and the number of HR source faces images when image size is larger than 8×8, and the resolution and quality of the hallucinated face image are greatly enhanced over the LR ones, which is very helpful for human recognition.
A Study on Genetic Algorithms for the DARP Problem
Authors: Claudio Cubillos, Nibaldo Rodriguez, Broderick Crawford
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

This work presents the results on applying a genetic approach for solving the Dial-A-Ride Problem (DARP). The problem consists of assigning and scheduling a set of user transport requests to a fleet of available vehicles in the most efficient way according to a given objective function. The literature offers different heuristics for solving DARP, a well known NP-hard problem, which range from traditional insertion and clustering algorithms to soft computing techniques. On the other hand, the approach through Genetic Algorithms (GA) has been experienced in problems of combinatorial optimization. We present our experience and results of a study to develop and test different GAs in the aim of finding an appropriate encoding and configuration, specifically for the DARP problem with time windows.
Sessions and Pipelines for Structured Service Programming
Authors: Michele Boreale, Roberto Bruni, Rocco Nicola, Michele Loreti
Venue: Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems (2008)

Service-oriented computing is calling for novel computational models and languages with primitives for client-server interaction, orchestration and unexpected events handling. We present CaSPiS, a process calculus where the notions of session and pipelining play a central role. Sessions are two-sided and can be equipped with protocols executed by each side. Pipelining permits orchestrating the flow of data produced by different sessions. The calculus is also equipped with operators for handling (unexpected) termination of the partner's side of a session. Several examples are presented to provide evidence for the flexibility of the chosen set of primitives. Our main result shows that in CaSPiS it is possible to program a "graceful termination" of nested sessions, which guarantees that no session is forced to hang forever after the loss of its partner.
Swarm Attacks against Network-Level Emulation/Analysis
Authors: Simon P. Chung, Aloysius K. Mok
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

It is always assumed that if the attackers can achieve their goal by exploiting a vulnerability once, they won't exploit it twice. This assumption shapes our view of what attacks look like, and affects the design of many security systems. In this work, we propose the swarm attack, in which the attacker deliberately exploits the same vulnerability multiple times, each intended to carry out only a small part of the attack goal. We have studied eight systems that detect attacks using network-level emulation/analysis, and find them surprisingly vulnerable to attacks based on this strategy.
Shellable Complexes and Topology of Diagonal Arrangements
Authors: Sangwook Kim
Venue: Discrete Computational Geometry (2008)

We prove that if a simplicial complex &#x0394; is shellable, then the intersection lattice L &#x0394; for the corresponding diagonal arrangement $\mathcal{A}_{\Delta }$is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on the data of shelling. Also, we give some examples of diagonal arrangements&#x00a0;$\mathcal{A}$where the complement $\mathcal{M}_{\mathcal{A}}$is K(&#x03c0;,1), coming from rank-3 matroids.
Image Registration Using Structural Corners
Authors: Shubin Zhao
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Image registration is an important task for many applications of image analysis and computer vision. Robustness and efficiency are two critical issues to be addressed in registering images. In this paper, a commonly used framework is adopted, where local features are first detected and then image registration is carried out by establishing the feature correspondences between two images. To ensure the robustness and repeatability, a novel approach is proposed to detect structural corners rather than the textural ones, because the structural features of images cannot be represented by textural corners. To establish the feature correspondences robustly and efficiently, modified Random Sample Consensus approach(RANSAC) is presented, where the information provided by the structural corners is utilized. Finally, the solution is obtained using the voting method. Experimental results show the effectiveness of the algorithm, especially when the images have been taken at different times and even by different sensors.
Leftist Grammars Are Non-primitive Recursive
Authors: Tomasz Jurdziński
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

Leftist grammars were introduced by Motwani et. al. [7], as a tool to show decidability of the accessibility problem in certain general protection systems. It is shown that the membership problem for languages defined by leftist grammars is non-primitive recursive. Therefore, by the reduction of Motwani et. al., the accessibility problem in the appropriate protection systems is non-primitive recursive as well.
Mixed p-z model for the analyze of the switching power circuits with periodic PWM
Authors: Jiri Klima
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

The mathematical method for the time-domain analysis of power converters with periodic pulse width modulation (PWM) is developed. The method is based on mixed p-z description of linear periodically time-varying system. The mathematical model uses the Laplace and modified Z transforms. The solution is not dependent on the number of the pulses of the PWM pattern. Instead of solution of algebraic equations the change of switching instants is reflected in the solution only by a change in two values mk and nk. All the results were visualized from the derived equations by the programme Mathcad. The derived equations are validated using a 3 kW three-phase inverter
A Multi-objective and Hierarchical Exploration Tool for SoC Performance Estimation
Authors: Alexis Biest, Alienor Richard, Dragomir Milojevic, Frederic Robert
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

In this paper we present a flexible performance estimation tool called Nessie developed to provide system-on-chip designers with automated multi-objective design space exploration and its related tool called Yeti building and executing reusable closed-formed models. After reviewing the existing closed-formed expressions based and application/platform mapping performance estimation tools, we propose an hybrid tool to cope with their limitations. We present a brief summary of the functionalities of Yeti and describe Nessie, our hierarchical application/platform performance estimation mapping tool which banalizes all the degrees of freedom for in-depth design space exploration and introduces multi-objective modeling. Through this paper, we explain how the combination of these tools provides the designer with innovative and powerful functionalities for performance prediction at the earlier stages of the design flow.
A Genetic-Neural Method of Optimizing Cut-Off Grade and Grade of Crude Ore
Authors: Yong He, Sixin Xu, Kejun Zhu, Ting Liu, Yue Li
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

Cut-off grade and grade of crude ore is crucial to the economic benefit of enterprise and sustainable utilization of resource in mining system. Generally, they are determined by experiment data or worker's experience, and they can't be widely used. In this work, we use genetic algorithm and neural networks nesting method to simulate the highly complexity and non-linear relationship of mine system, to optimize the cut-off grade and grade of crude ore. The inner layer of nesting is neural networks, which is used to compute loss rate, amount of tailing ore and total cost; the outer layer is genetic algorithm, with cut-off grade and grade of crude ore as chromosome, which is used to get the revenue. These two layers carry out the optimization of cut-off grade and grade of crude ore jointly. Take Daye Iron Mine as a case, the result shows that: During the period of August to November in the year 2007, the optimal cut-off grade is 15.8%, and optimal grade of crude ore is 43.7762-44.1387%. Comparing with the present scheme (cut-off grade is 18%, grade of crude ore is 41-43%), the optimized scheme can improve the present value by 9.01-9.44 million Yuan.
Detection of DTI White Matter Abnormalities in Multiple Sclerosis Patients
Authors: Olivier Commowick, Pierre Fillard, Olivier Clatz, Simon K. Warfield
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

The emergence of new modalities such as Diffusion Tensor Imaging (DTI) is of great interest for the characterization and the temporal study of Multiple Sclerosis (MS). DTI indeed gives information on water diffusion within tissues and could therefore reveal alterations in white matter fibers before being visible in conventional MRI. However, recent studies generally rely on scalar measures derived from the tensors such as FA or MD instead of using the full tensor itself. Therefore, a certain amount of information is left unused.In this article, we present a framework to study the benefits of using the whole diffusion tensor information to detect statistically significant differences between each individual MS patient and a database of control subjects. This framework, based on the comparison of the MS patient DTI and a mean DTI atlas built from the control subjects, allows us to look for differences both in normally appearing white matter but also in and around the lesions of each patient. We present a study on a database of 11 MS patients, showing the ability of the DTI to detect not only significant differences on the lesions but also in regions around them, enabling an early detection of an extension of the MS disease.
Aggregation of Service Level Agreements in the Context of Business Processes
Authors: Tobias Unger, Frank Leymann, Stephanie Mauchart, Thorsten Scheibler
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

One can observe that more and more companies are focusing on their core compenetency and are outsourcing parts or even complete business processes to service providers. Service Level Agreements (SLAs) are used as a contractual basis to define certain non-functional properties (e.g. response time) a service has to provide. To determine the SLA of a business process a priori, the SLAs of the invoked services need to be aggregated into a single SLA for the business process. This paper defines a method how a service provider can aggregate the SLAs of the individual services within a business process into a single SLA. This provides a service provider with the capability to annotate the service that the business process implements with an appropriate SLA. We propose a framework that helps in carrying out the SLA aggregation within business processes. The framework consists of two parts: (i) a formal model for SLAs and (ii) a concept to aggregate SLAs, where algorithms can be plugged in.
Plenary lecture III: risk and reliability analysis of flexible manufacturing systems
Authors: Calin I. Ciufudean
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

Thinking to risk and reliability analysis of flexible manufacturing systems (FMS) from a probabilistic perspective, leads to the conclusion that probability is a measure of expressing uncertainty about the process seen through the point of view of the assessor (i.e. the controller of the process), and based on some background information and knowledge that we have at the time we quantify our uncertainty. A distinction between objective, real risk, and perceived risk cannot be made. Risk is primarily a judgment, not a fact. As risk expresses uncertainty about the process outcomes, risk perception has a role to play to guide the decision of the controller. A number of different types of models are used in risk analysis. These include both quantity-oriented models and event oriented models. It is difficult to give a detailed specification of what a satisfactory model is. How accurate must a model be in order to be considered satisfactory? One may say that a necessary requirement for a risk model is that any improvement in the model to make it more accurate, as judged by the controller, should not lead to a change in the conclusions considered. Also, when analyzing FMS's performance, human and organizational factors need to be taken into account. For instance, the conventional reliability analysis is based on the premise that increasing the reliability of a system will decrease the losses from failures; but an inappropriate increase of the reliability of the system may determine the risk of a simultaneous increase of the losses from the failure. In order to avoid these situations, an efficient discrete-event simulation model has been proposed for reducing the risk of the reliability analysis based on the losses from failure for FMS. The proposed model have been successfully applied and tested for the reliability value analysis of FMS in railway transportation.