ppxscal/embedding_network huggingface dataset:
Receding horizon H∞ control problems for sampled-data systems
Authors: Hitoshi Katayama, Akira Ichikawa
Venue: International Journal of Systems Science (2007)

In this article, the receding horizon H∞ control problems for sampled-data system are considered. Since sampled-data systems can be rewritten as equivalent jump systems, the receding horizon H∞ control problems for time-varying jump systems are considered first and the design methods of a state feedback receding horizon H∞ controller and an output feedback receding horizon H∞ controller are given. Then the obtained results are applied to sampled-data systems and the design methods of a state feedback receding horizon H∞ controller and an output feedback receding horizon H∞ controller are given. Two numerical examples are given to illustrate the theory.
Informationally optimal correlation
Authors: Olivier Gossner, Rida Laraki, Tristan Tomala
Venue: Mathematical Programming: Series A and B (2008)

This papers studies an optimization problem under entropy constraints arising from repeated games with signals. We provide general properties of solutions and a full characterization of optimal solutions for 2&#x00a0;&#x00d7; 2 sets of actions. As an application we compute the minmax values of some repeated games with signals.
LECTURES ON QED AND QCD: PRACTICAL CALCULATION AND RENORMALIZATION OF ONE- AND MULTI-LOOP FEYNMAN DIAGRAMS
Authors: Andrey Grozin
Venue:  (2007)

The increasing precision of experimental data in many areas of elementary particle physics requires an equally precise theoretical description. In particular, radiative corrections (described by one- and multi-loop Feynman diagrams) have to be considered. Although a growing number of physicists are involved in such projects, multi-loop calculation methods can only be studied from original publications. With its coverage of multi-loop calculations, this book serves as an excellent supplement to the standard textbooks on quantum field theory. Based around postgraduate-level lectures given by the author, the material is suitable for both beginners and graduate students.
A framework for simulation of surrounding vehicles in driving simulators
Authors: Johan Janson Olstam, Jan Lundgren, Mikael Adlers, Pontus Matstoms
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2008)

This article describes a framework for generation and simulation of surrounding vehicles in a driving simulator. The proposed framework generates a traffic stream, corresponding to a given target flow and simulates realistic interactions between vehicles. The framework is based on an approach in which only a limited area around the driving simulator vehicle is simulated. This closest neighborhood is divided into one inner area and two outer areas. Vehicles in the inner area are simulated according to a microscopic simulation model including advanced submodels for driving behavior while vehicles in the outer areas are updated according to a less time-consuming mesoscopic simulation model. The presented work includes a new framework for generating and simulating vehicles within a moving area. It also includes the development of an enhanced model for overtakings and a simple mesoscopic traffic model. The framework has been validated on the number of vehicles that catch up with the driving simulator vehicle and vice versa. The agreement is good for active and passive catch-ups on rural roads and for passive catch-ups on freeways, but less good for active catch-ups on freeways. The reason for this seems to be deficiencies in the utilized lane-changing model. It has been verified that the framework is able to achieve the target flow and that there is a gain in computational time of using the outer areas. The framework has also been tested within the VTI Driving simulator III.
Wireless and physical security via embedded sensor networks
Authors: Michael J. Ocean, Azer Bestavros
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

Wireless Intrusion Detection Systems (WIDS) monitor 802.11 wireless frames(Layer-2) in an attempt to detect misuse. What distinguishes a WIDS from a traditional Network IDS is the ability to utilize the broadcast nature of the medium to reconstruct the physical location of the offending party, as opposed to its possibly spoofed (MAC addresses) identity in cyber space. Traditional Wireless Network Security Systems are still heavily anchored in the digital plane of cyber space and hence cannot be used reliably or effectively to derive the physical identity of an intruder in order to prevent further malicious wireless broadcasts, for example by escorting an intruder off the premises based on physical evidence. In this paper, we argue that Embedded Sensor Networks could be used effectively to bridge the gap between digital and physical security planes, and thus could be leveraged to provide reciprocal benefit to surveillance and security tasks on both planes. Toward that end, we present our recent experience integrating wireless networking security services into the SNBENCH (SensorNetwork workBench). The SNBENCH provides an extensible framework that enables the rapid development and automated deployment of Sensor Network applications on a shared, embedded sensing and actuation infrastructure. The SNBENCH's extensible architecture allows an engineer to quickly integrate new sensing and response capabilities into the SNBENCH framework, while high-level languages and compilers allow novice SN programmers to compose SN service logic, unaware of the lower-level implementation details of tools on which their services rely. In this paper we convey the simplicity of the service composition through concrete examples that illustrate the power and potential of Wireless Security Services that span both the physical and digital plane.
Algorithm for rapid particle tracing in arbitrarily mixed meshes
Authors: Andreas Hieke
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

An algorithm is described which allows the rapid computation of trajectories of large numbers of particles in arbitrary meshes. Laplace (Poisson) and Navier-Stokes solutions are given at node points of a (FEM) mesh consisting of arbitrarily mixed tetrahedral, prismatic, pyramidal, or tetrahedral elements. The computation of the motion of a particle through such a domain requires, at each time step, knowledge of the enclosing element. Brute-force search routines would be prohibitively expensive with mesh data sets on the order of Gbyte, typical numbers of particles ranging from 103 to 105, and trajectory integration time steps from 103 to 107.
The fibers and range of reduction graphs in ciliates
Authors: Robert Brijder, Hendrik Jan Hoogeboom
Venue: Acta Informatica (2008)

The biological process of gene assembly transforms a nucleus (the MIC) into a functionally and physically different nucleus (the MAC). For each gene in the MIC (the input), recombination operations transform the gene to its MAC form (the output). Here we characterize which inputs obtain the same output, and moreover characterize the possible forms of the outputs. We do this in the abstract and more general setting of so-called legal strings.
Knowledge discovery in Chinese medicine
Authors: Tongyuan Wang, Bipin C. Desai, Huzhan Zheng, Yanjiang Qiao
Venue: Proceedings of the 2008 C3S2E conference (2008)

Our motivation for knowledge discovery in Chinese medicine is two folds: innovate and verify effective data mining technology in realistic applications; and update Chinese medical informatics. This paper focuses on the former aspect. To develop effective mining functions for Chinese medicine study, we have considered a number of critical issues including: data complications, mining model reliability, and mining tools' usability. The result is a fuzzy based "Hyper Knowledge Discovery System" (HKDS). This paper presents our recently proposed concepts and approaches as well as their flexibility and interactivity in information retrieval and association rule mining embodied in HKDS.
The inverted pendulum model of bipedal standing cannot be stabilized through direct feedback of force and contractile element length and velocity at realistic series elastic element stiffness
Authors: A. A. J. &#x201c;Knoek&#x201d; van Soest, Leonard A. Rozendaal
Venue: Biological Cybernetics (2008)

Control of bipedal standing is typically analyzed in the context of a single-segment inverted pendulum model. The stiffness K SE of the series elastic element that transmits the force generated by the contractile elements of the ankle plantarflexors to the skeletal system has been reported to be smaller in magnitude than the destabilizing gravitational stiffness K g . In this study, we assess, in case K SE&#x00a0;+&#x00a0;K g &#x00a0;<&#x00a0; 0, if bipedal standing can be locally stable under direct feedback of contractile element length, contractile element velocity (both sensed by muscle spindles) and muscle force (sensed by Golgi tendon organs) to alpha-motoneuron activity. A theoretical analysis reveals that even though positive feedback of force may increase the stiffness of the muscle&#x2013;tendon complex to values well over the destabilizing gravitational stiffness, dynamic instability makes it impossible to obtain locally stable standing under the conditions assumed.
Executable Protocol Models as a Requirements Engineering Tool
Authors: Ashley McNeile, Ella Roubtsova
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

Functional prototypes and simulations are a well recognized and valued tool for building a shared understanding of requirements between users and developers. However, the development of such artifacts does not sit well with traditional modeling techniques, which do not lend themselves to direct execution. Consequently building prototypes and simulations becomes a diversion from the mainstream development process, and sometimes even competes with it. We propose that the resolution to this conflict lies in promoting the role of executable behavioral models, so thatartifacts supporting behavioral simulation are a by-product of the mainstream modeling process. We discuss why conventional modeling techniques are not suited to this, and we describe an innovative behavioral modeling technique, Protocol Modeling, that is well suited to direct execution. Using Protocol Modeling, a behavioral entity (business object or process) is modeled in terms of its event protocol: the conditions under which it accepts or refuses events. Such models capture the behavioral integrity rules at the level of business events; and can be composed using the semantics of Hoare’s CSP, allowing concise and incremental representation. Direct execution of the model is achieved using a tool that simulates a normal user interface, so that non-technical stakeholders can review and explore behavior while requirements are being solidified.
Reliable dynamic reconfigurations in the fractal component model
Authors: Marc Léger, Thomas Ledoux, Thierry Coupaye
Venue: Proceedings of the 6th international workshop on Adaptive and reflective middleware: held at the ACM/IFIP/USENIX International Middleware Conference (2007)

This article is an analysis based on our experience with the Fractal component model of the need of reliability for dynamic reconfigurations in component based systems. We make a proposal to ensure this reliability for concurrent and distributed Fractal applications. We started from the definition of ACID properties in the context of dynamic reconfigurations in component models and we propose to use integrity constraints to define system consistency and transactions for guaranteeing the respect of these constraints at runtime. Moreover we manage concurrency between reconfigurations by avoiding potential conflicts between reconfiguration operations. Finally, a recovery mechanism has been conceived to deal with failures.
A view-dependent method for the multi-resolution representation of terrains with roads embedded
Authors: X. Zuo, Q. Li, B. Yang, T. Cheng
Venue: International Journal of Remote Sensing (2007)

Generating multi-resolution terrain models dynamically is necessary for rapid visualization because of the huge volume of data and the limited memory of computers. However, it is difficult to generate dynamic multi-resolution terrain models with the roads embedded. This paper proposes a new method for generating these models. In contrast to previous approaches, our method divides the integrated terrains into multiple levels with a '▒' shape, and dynamically generates multi-resolution terrain models with the roads embedded. Moreover, our method efficiently overcomes thin, long-shaped triangles in multi-resolution terrain models. On the other hand, the number of triangles in adjacent frames is efficiently updated during walking/flying through visualization. The experimental results demonstrate that the proposed method acquires better performance in terms of accuracy for the multi-resolution representation of terrains with the roads embedded.
Range bounding with Taylor models: some case studies
Authors: Kyoko Makino, Martin Berz, Youn-Kyung Kim
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

Taylor model methods represent a combination of high-order multivariate automatic differentiation and the simultaneous computation of an interval remainder bound enclosing approximation error over a given domain. This method allows a far-reaching suppression of the dependency problem common to interval methods, and can thus often be used for precise range bounding problems. We compare the performance of the method with other state of the art validated tools including centered forms and mean value forms. We also compare with the computation of remainder bounds via high-order interval automatic differentiation.
Variability of flip-flop timing at sub-threshold voltages
Authors: Niklas Lotze, Maurits Ortmanns, Yiannos Manoli
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

The design of sub-threshold circuits is especially challenging due to the massive impact of process variations. These variabilities also heavily affect circuit timing, a problem only considered concerning combinational gates so far. In this paper the effects of process variations on flip-flop timing at sub-threshold voltages are analyzed based on extensive monte-carlo simulations. The results show that the usual timing-optimal definition of timing parameters needs to be replaced by a reliability-driven approach. The model is validated for sub- and near-threshold supply voltages and an approach for energy-optimal sizing is presented.
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs
Authors: Henning Bruhn, Reinhard Diestel, Maya Stein
Venue: Journal of Graph Theory (2005)

By a result of Gallai, every finite graph G has a vertex partition into two parts each inducing an element of its cycle space. This fails for infinite graphs if, as usual, the cycle space is defined as the span of the edge sets of finite cycles in G. However, we show that, for the adaptation of the cycle space to infinite graphs recently introduced by Diestel and K&uuml;hn (which involves infinite cycles as well as finite ones), Gallai's theorem extends to locally finite graphs. Using similar techniques, we show that if Seymour's faithful cycle cover conjecture is true for finite graphs then it also holds for locally finite graphs when infinite cyles are allowed in the cover, but not otherwise. We also consider extensions to graphs with infinite degrees. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
A curriculum design on embedded system education for first-year graduate students
Authors: Jing Chen, Hui-Ming Su, Jian-Horng Liu
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

The embedded system is blooming. A lot of undergraduates are absorbed to devote themselves to this domain in recent years. Generally speaking, most undergraduates are deficient in the background knowledge about embedded system science. To build the essential background knowledge, we have a curriculum on embedded systems for first-year graduate students in their first summer vacation. We surveyed the curriculum of many universities and found them focuses on programming skills training. The students didn&#x2019;t interest in learning through this kind of curriculum in our empirical results. As reforming the curriculum year by year, we have devised a curriculum delivering the background knowledge to students by effective methods. The curriculum contains two major parts. The first part is embedded system guidance courses. It navigates the students in the embedded system science. Students will understand the applications domains, development methods, research issues, and challenges of embedded systems through these courses. The lecturer must issue some open-ended questions and assign homework of paper reading to help students thinking. The second part is the programming skills training. It is the hardest challenge for most students because they are deficient in the background knowledge of development tools as well as the hardware. Lab practice is an efficient way familiar with development tools and hardware for students. We carry on the teaching activities in an iterative and incremental method. The lecturer must depend on each student&#x2019;s learning status to adjust the quantities of Lab units. According to a survey of students went through this curriculum, it shows the teaching effect is quite good for most students.
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
Authors: Roberto Baldacci, Nicos Christofides, Aristide Mingozzi
Venue: Mathematical Programming: Series A and B (2008)

This paper presents a new exact algorithm for the Capacitated Vehicle Routing Problem (CVRP) based on the set partitioning formulation with additional cuts that correspond to capacity and clique inequalities. The exact algorithm uses a bounding procedure that finds a near optimal dual solution of the LP-relaxation of the resulting mathematical formulation by combining three dual ascent heuristics. The first dual heuristic is based on the q-route relaxation of the set partitioning formulation of the CVRP. The second one combines Lagrangean relaxation, pricing and cut generation. The third attempts to close the duality gap left by the first two procedures using a classical pricing and cut generation technique. The final dual solution is used to generate a reduced problem containing only the routes whose reduced costs are smaller than the gap between an upper bound and the lower bound achieved. The resulting problem is solved by an integer programming solver. Computational results over the main instances from the literature show the effectiveness of the proposed algorithm.
A new ppm variant for chinese text compression
Authors: Peiliang Wu, W. j. Teahan
Venue: Natural Language Engineering (2008)

Large alphabet languages such as Chinese are very different from English, and therefore present different problems for text compression. In this article, we first examine the characteristics of Chinese, then we introduce a new variant of the Prediction by Partial Match (PPM) model especially for Chinese characters. Unlike the traditional PPM coding schemes, which encodes an escape probability if a novel character occurs in the context, the new coding scheme directly encodes the order first before encoding a symbol, without having to output an escape probability. This scheme achieves excellent compression rates in comparison with other schemes on a variety of Chinese text files.
Cryptography with constant computational overhead
Authors: Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

Current constructions of cryptographic primitives typically involve a large multiplicative computational overhead that grows with the desired level of security. We explore the possibility of implementing basic cryptographic primitives, such as encryption, authentication, signatures, and secure two-party computation, while incurring only a constant computational overhead compared to insecure implementations of the same tasks. Here we make the usual security requirement that the advantage of any polynomial-time attacker must be negligible in the input length. We obtain affirmative answers to this question for most central cryptographic primitives under plausible, albeit sometimes nonstandard, intractability assumptions. We start by showing that pairwise-independent hash functions can be computed by linear-size circuits, disproving a conjecture of Mansour, Nisan, and Tiwari (STOC 1990). This construction does not rely on any unproven assumptions and is of independent interest. Our hash functions can be used to construct message authentication schemes with constant overhead from any one-way function. Under an intractability assumption that generalizes a previous assumption of Alekhnovich (FOCS 2003), we get (public and private key) encryption schemes with constant overhead. Using an exponentially strong version of the previous assumption, we get signature schemes of similar complexity. Assuming the existence of pseudorandom generators in NC z with polynomial stretch together with the existence of an (arbitrary) oblivious transfer protocol, we get similar results for the seemingly very complex task of secure two-party computation. More concretely, we get general protocols for secure two-party computation in the semi-honest model in which the two parties can be implemented by circuits whose size is a constant multiple of the size s of the circuit to be evaluated. In the malicious model, we get protocols whose communication complexity is a constant multiple of s and whose computational complexity is slightly super-linear in s. For natural relaxations of security in the malicious model that are still meaningful in practice, we can also keep the computational complexity linear in s. These results extend to the case of a constant number of parties, where an arbitrary subset of the parties can be corrupted. Our protocols rely on non-black-box techniques, and suggest the intriguing possibility that the ultimate efficiency in this area of cryptography can be obtained via such techniques.
Information flows and social capital in weblogs: a case study in the Brazilian blogosphere
Authors: Raquel da Cunha Recuero
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

Blogs are tools for publishing information that have become very popular due to the way they facilitate the process of publishing on the Internet. Due to their popularity, blogs influence how information flows in cyberspace. This paper deals with the relations between bloggers' perceived social capital and motivations with the information they choose to publish. Based on a case study of a network of 48 weblogs, 32 interviews and 988 analyzed memes, we show how, for the studied case, information flow is influenced by bloggers' motivations and perceptions.