ppxscal/embedding_network huggingface dataset:
Design and implementation of an XML-based, technology-unified data pipeline for interactive simulation
Authors: François Rioux, François Bernier, Denis Laurendeau
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Providing software that is efficient, flexible, reusable and easy to work with is a hard task for simulation developers. In this paper we propose the use of XML and its related tools (e.g. JAXB, XQuery, XSLT, and Native XML Database) for the implementation of a technology-unified data pipeline targeted to interactive simulation. We introduce a technology-independent conceptual data model as the basis for every simulation framework. We show that XML is a well-suited technology to be used in that context. We propose a data modeling methodology that takes its roots from Model-Driven Engineering (MDE). We also show a sample implementation that uses XML for transmitting data over the entire simulation loop. We thus present our experience in implementing that kind of architecture and discuss how the use of XML and associated technologies help in building a unified and generic data pipeline for interactive simulation.
Criminal cycles in the illegal drug industry: a system dynamics approach applied to Colombia
Authors: Sebastián Jaén, Isaac Dyner
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The coca farming dynamics seem to partially follow the patterns of a long war against organized crime in Colombian. Since the early 80s, the cocaine market in the US and the rest of the world has been mainly supplied by Colombian cartels. Consequently, these illegal organizations have been targeted by Colombian and American law enforcement agencies. Our work argues that such policy has had a counter-intuitive effect which has contributed to increases in coca farming and reductions in cocaine prices. This paper hypothesizes that such situation was the consequence of the way that drug cartels were dismantled - thus the Colombian paradox. The consequences of the war against cartels may be assessed with the support of a dynamic theoretical framework and SD. This research assesses alternative policy for dismantling drug cartels.
Decoupling of Heterogeneous Semantic Service Annotations and Their Semantic Models --- Towards an Integrated Approach in a Multi-Service-Provider-Scenario
Authors: Jannis Rake, Marten Schönherr
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

The introduction of Service-Oriented Architectures often promises effective and efficient service support of the organization's business processes. Matching and combining the right services to support the processes can only be ensured, if the service functionalities are semantically annotated. However, service discovery within heterogeneous annotations can become a problem. The following paper introduces an integrated approach to deal with heterogeneous semantic annotations of different service providers. Based on deduction from the state-of-the-art of semantic annotations for services, the developed approach establishes four strategies as the prerequisites for a common search base.
Approximation hardness of deadline-TSP reoptimization
Authors: Hans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke
Venue: Theoretical Computer Science (2009)

Given an instance of an optimization problem together with an optimal solution, we consider the scenario in which this instance is modified locally. In graph problems, e.g., a singular edge might be removed or added, or an edge weight might be varied, etc. For a problem U and such a local modification operation, let lm-U (local-modification-U) denote the resulting problem. The question is whether it is possible to exploit the additional knowledge of an optimal solution to the original instance or not, i.e.,whether lm-U is computationally more tractable than U. While positive examples are known e.g. for metric TSP, we give some negative examples here: Metric TSP with deadlines (time windows), if a single deadline or the cost of a single edge is modified, exhibits the same lower bounds on the approximability in these local-modification versions as those currently known for the original problem.
Vision-based production of personalized video
Authors: D. I. Kosmopoulos, A. Doulamis, A. Makris, N. Doulamis, S. Chatzis, S. E. Middleton
Venue: Image Communication (2009)

In this paper we present a novel vision-based system for the automated production of personalized video souvenirs for visitors in leisure and cultural heritage venues. Visitors are visually identified and tracked through a camera network. The system produces a personalized DVD souvenir at the end of a visitor's stay allowing visitors to relive their experiences. We analyze how we identify visitors by fusing facial and body features, how we track visitors, how the tracker recovers from failures due to occlusions, as well as how we annotate and compile the final product. Our experiments demonstrate the feasibility of the proposed approach.
Digital signal generator for railway signalling technology
Authors: Martin Poupa
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

This article deals with a design of a digital signal generator for the railway signalling technology. At present time signal generators and phase sensitive receivers are used as the railway signalling technology by the Czech Railways. These signal generators and phase sensitive receivers are used for detecting the presence of railway vehicles at the rail circuit and for checking of the rails integrity. The digital signal generator was designed using a direct digital synthesis. The generator is realized by VHDL language and implemented in a FPGA (Field Programmable Gate Array) device.
Programming languages and program analysis for security: a three-year retrospective
Authors: Marco Pistoia, Úlfar Erlingsson
Venue: ACM SIGPLAN Notices (2009)

Software security has been traditionally enforced at the level of operating systems. However, operating systems have become increasingly large and complex, and it is very difficult--if not impossible--to enforce software security solely through them. Moreover, operating-system security allows dealing primarily with access-control policies on resources such as files and network connections. However, attacks may happen at both lower and higher levels of abstraction, and may target the internal behavior of applications, such as today's Web-based applications. Therefore, defenses must offer protection at the level of applications. Language-based security is the area of research that studies how to enforce application-level security using programming-language and program-analysis techniques. This area of research has become very active with the advent of Web applications. In 2006, the ACM SIGPLAN has introduced a new yearly forum entirely dedicated to the discussion of language-based-security research: Programming Languages and Analysis for Security (PLAS). This paper is a three-year survey of PLAS papers that discusses the progress made in the area of language-based security.
Experimental Evaluation of the Super Sweep Spectrum Analyzer
Authors: Masao Nagano, Toshio Onodera, Mototaka Sone
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A sweep spectrum analyzer has been improved over the years, but the fundamental method has not been changed before the 'Super Sweep' method appeared. The 'Super Sweep' method has been expected to break the limitation of the conventional sweep spectrum analyzer, a limit of the maximum sweep rate which is in inverse proportion to the square of the frequency resolution. The superior performance of the 'Super Sweep' method, however, has not been experimentally proved yet. This paper gives the experimental evaluation on the 'Super Sweep' spectrum analyzer, of which theoretical concepts have already been presented by the authors of this paper. Before giving the experimental results, we give complete analysis for a sweep spectrum analyzer and express the principle of the super-sweep operation with a complete set of equations. We developed an experimental system whose components operated in an optimum condition as the spectrum analyzer. Then we investigated its properties, a peak level reduction and broadening of the frequency resolution of the measured spectrum, by changing the sweep rate. We also confirmed that the experimental system satisfactorily detected the spectrum at least 30 times faster than the conventional method and the sweep rate was in proportion to the bandwidth of the base band signal to be analyzed. We proved that the 'Super Sweep' method broke the restriction of the sweep rate put on a conventional sweep spectrum analyzer.
Development of an integrated-collaborative decision making framework for product top-down design process
Authors: Li Yu-liang, Zhao Wei
Venue: Robotics and Computer-Integrated Manufacturing (2009)

A process model based on product function and physical topology structure is proposed. This model decomposes the product top-down design process into module design task, part design task, design parameter and dependencies among them. According to the characteristics of the design process, an integrated collaborative design software framework is designed, which includes module task agent, part task agent and sensitivity-based collaborative design method for agents. The system is developed with Java and Web technologies and applied to the transmission design case to demonstrate its utilization and efficiency.
Numerical model reduction of 2D steady incompressible laminar flows: Application on the flow over a backward-facing step
Authors: Y. Rouizi, Y. Favennec, J. Ventura, D. Petit
Venue: Journal of Computational Physics (2009)

The numerical solution of most fluid mechanics problems usually needs such a fine mesh that the associated computational times become non-negligible parts in any design process. In order to couple numerical modelling schemes with inversion or control algorithms, the size of such models needs to be highly reduced. The identification method is a way to build low-order models that fit with the original ones. The laminar flow over a backward-facing step is used as a test case. Presented solutions are found to be in good agreement with experimental and numerical results found in the literature.
A comparative study of important risk factors involved in offshore and domestic outsourcing of software development projects: A two-panel Delphi study
Authors: Robbie T. Nakatsu, Charalambos L. Iacovou
Venue: Information and Management (2009)

We investigated the risk factors of outsourced software development. Our first objective was to create empirically generated lists of risk factors for both domestically- and offshore-outsourced projects. Our second objective was to compare these two contexts: how do the risk factors change and which ones are most important in each. To address these objectives, we conducted two Delphi surveys to identify the important risk factors from a client perspective, in domestic and offshore settings. We qualitatively compared the results of the surveys to identify similarities and differences across their risk profiles. We identified three types of risks: those that appeared in both contexts; those that appeared in both but were exacerbated in the offshore context; and those that were unique to the offshore context. Our findings suggested that traditional project management risks were important in both contexts; however, the offshore context seemed to be more vulnerable to some traditional risks as well as factors that were unique to it.
Upwind discretization of a time-dependent two-dimensional grade-two fluid model
Authors: Hyam Abboud, Toni Sayah
Venue: Computers Mathematics with Applications (2009)

In this paper, we propose a finite-element scheme for solving numerically the equations of a transient two-dimensional grade-two non-Newtonian Rivlin-Ericksen fluid model. This system of equations is considered an appropriate model for the motion of a water solution of polymers. By introducing a new variable denoted z, we split the problem into a coupled one with a transport equation. As one of our aims is to derive unconditional a priori estimates from the discrete analogue of the transport equation, we stabilize our scheme by adding a consistent stabilizing term. We use the P"2-P"1 Taylor-Hood finite-element scheme for the velocity v and the pressure p, and the discontinuous P"1 finite element for an auxiliary variable z. The error is of the order of h^3^/^2+k, considering that the discretization of the transport equation loses inevitably a factor h^1^/^2.
Embedded Smart Camera Performance Analysis
Authors: N. F. Kahar, R. B. Ahmad, Z. Hussin, A. N. C. Rosli
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Increasingly powerful integrated circuits are making an entire range of new applications possible. Recent technological advances are enabling a new generation of smart cameras that represent a quantum leap in sophistication. While today’s digital cameras capture images, smart camera capture high-level descriptions of the scene and analyze what they see. A smart camera combines video sensing, high-level video processing and communication within a single embedded device. Smart cameras not only capture images, they further perform high-level image processing on-board, and transfer the data via network. In this project, embedded smart camera utilizing the use of Single Board Computer (SBC) and GNU/Linux is presented. This paper presents the performance analysis on processing speed and CPU utilization for embedded smart camera using three different computer platforms. Two Single Board Computers from Technologic System, TS-5500 and TS-7200 are being introduced in this paper. The hardware and software design as well as the experimental results are also presented.
Face Detection in Color Images using Wavelet Packet Analysis
Authors: C. Garcia, G. Zikos, G. Tziritas
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper, we propose a novel scheme for automatic and fast detection of human faces in color images where the number, the location, the orientation and the size of the faces are unknown, under non-constrained scene conditions such as complex background and uncontrolled illumination.First, each frame is segmented using skin chrominance values, providing face area candidates. Then, shape analysis and wavelet packet decomposition are performed on the face area candidates in order to detect human faces. Each face area candidate is described by a subset of band filtered images containing wavelet coefficients. These coefficients characterize the face texture and a set of simple statistical data is extracted in order to form compact and meaningful feature vectors. Then, an efficient and reliable probabilistic metric derived from the Bhattacharrya distance is used in order to classify the face area candidate feature vectors into face or non-face areas.
A Dynamic Survivability Reconfiguration Framework Based on QoS
Authors: Wang Li, Li-Zhi Shu, Yin Feng
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Traditional security approaches are not sufficient to deal with the protection and survivability of highly distributed information systems operating in unbounded networks. In view of the deficiencies of the essential services’ self-recovering when the survivable system is not available, an efficient self-adjusting reconfiguration framework on system survivability is presented based on the service-level QoS. In this framework, some QoS metrics are discussed, and the survivability reconfiguration trigger condition is made, then the application steps of survivability reconfiguration are described in detail, and corresponding dynamic reconfiguration algorithm is given. The framework can probe the newest state of system, give the decision guideline quantificationally, and execute the dynamic reconfiguration algorithm in bounded time when system suffers attack or failure, then take some reconfiguration actions correctly.
Proper Virtual Private Network (VPN) Solution
Authors: Ahmed A. Jaha, Fathi Ben Shatwan, Majdi Ashibani
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

A Virtual Private Network (VPN) can be defined as a way to provide secure communication between members of a group through use of public telecommunication infrastructure, maintaining privacy through the use of a tunneling protocol and security procedures. There are many different VPN solutions out there, and just deciding which one to choose can be difficult since they all have advantages and disadvantages. VPNs can be categorized as Secure or Trusted VPNs, Client-based or Web-based VPNs, Customer Edge-based or Provider Edge-based VPNs, or Outsourced or In-house VPNs. These categories often overlap each other. In order to decide what VPN solutions to choose for different parts of the enterprise infrastructure, the chosen solution should be the one that best meets the requirements of the enterprise. The purpose of this paper is to serve as a basis when creating an enterprise WAN which connects sites and users together using VPN technology. The purpose of creating such a WAN is to allow the resources of a company to be remotely accessed.
Multiple View Geometry of Projector-Camera Systems from Virtual Mutual Projection
Authors: Shuhei Kobayashi, Fumihiko Sakaue, Jun Sato
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Recently, projector camera systems have been used actively for image synthesis and for 3D reconstruction. For using the projector camera systems in these applications, it is very important to compute the geometry between projectors and cameras accurately. Recently, it has been shown that by using the mutual projection of cameras, multiple cameras are calibrated quite accurately. However, this property cannot be used for projector camera systems, since projectors are light-emitting devices and the projection of cameras cannot be obtained in projector images. In this paper, we show that by using the shadow of cameras and the shadow of projectors generated by projector light, we can generate virtual mutual projections between projectors and cameras, and projectors and projectors. These virtual mutual projections can be used for calibrating projector-camera systems quite accurately. Furthermore, the calibration can be achieved without using any 3D points unlike the existing calibration methods. The accuracy of the proposed method is evaluated by using real and synthetic images.
The GIANO Project: Combining Hypermedia and Network Technologies for Applications to the Cultural Heritage
Authors: D. Biagi Maino1, G. Maino
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We present an international research program for the development and application of multimedia tools to the investigation of the cultural heritage. A networking prototype computing system will be produced for the efficient storage and processing of multimedia data referring to works of art and historical documents, including results of chemical and physical analyses and reports about interventions of restoration. Main applications will be concerned with Italian paintings and frescoes from XV to XVIII century and archives on the Byzantine sea trade in the Mediterranean area.
Argumentation- vs. Proposal-Based Negotiation: An Empirical Case Study on the Basis of Game-Theoretic Solution Concepts
Authors: Angelika Först, Achim Rettinger, Matthias Nickles
Venue: Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers (2009)

Recently, argumentation-based negotiation has been proposed as an alternative to classical mechanism design. The main advantage of argumentation-based negotiation is that it allows agents to exchange complex justification positions rather than just simple proposals. Its proponents maintain that this property of argumentation protocols can lead to faster and beneficial agreements when used for complex multiagent negotiation. In this paper, we present an empirical comparison of argumentation-based negotiation to proposal-based negotiation in a strategic two-player scenario. We apply a game-theoretic solution as a benchmark, which requires full knowledge of the stage games. Our experiments show that in fact the argumentation-based approach outperforms the proposal-based approach with respect to the quality of the agreements found and the overall time to agreement.
The design of PLAIN: support for systematic programming
Authors: Anthony I. Wasserman
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The successful construction of medium and large software systems requires the management of the complexity inherent in the problem being programmed. A well-disciplined approach to software development involves the production of a complete specification, a complete problem solution, and program design prior to the inception of actual coding. In practice, this requires the production of some form of program design representation [1] from the original specification, with the action of each module specified with a program design language [2]. Furthermore, data structures are specified and refined, in some cases to physical data structures, but more commonly to logical data structures.
Trends in highly scalable crossbar-based packet switch architecture
Authors: Kenji Yoshigoe
Venue: Computer Communications (2009)

A combined input and crosspoint queued (CICQ) switch is receiving significant attention to be the next generation high speed packet switch for its scalability; however, a multi-cabinet implementation of a combined input and crosspoint queued (CICQ) switch unavoidably introduces a large round-trip time (RTT) latency between the line cards and switch fabric, resulting a large crosspoint (CP) buffer requirement. In this paper, virtual crosspoint queues (VCQs) that significantly reduces the CP buffer requirement of the CICQ switch is investigated. The VCQs unit resides inside the switch fabric, is dynamically shared among virtual output queues (VOQ) from the same source port, and is operated at the line rate, making the implementation practical. A threshold-based exhaustive round-robin (T-ERR) arbitration is employed to reduce buffer hogging at VCQ. The T-ERR at VCQ and CP arbiters serves packets residing in a longer queue more frequently than packet residing in a shorter queue. Consequently, the T-ERR, drastically increases the throughput of the CICQ switch with small CP buffers. A multi-cabinet implementation of CICQ switch do not support multicasting traffic well since a combination of small CP buffer in the switch fabric and a large RTT latency between the line cards and switch fabric results in non-work conservation of the intra-switch link. Deployment of multicast FIFO buffer between the input buffer and CP buffer shows a promise. With its ability to achieve high throughput independent of RTT and switch port size, the integration of the VCQ architecture and T-ERR scheduler to the CICQ switch is ideal for supporting ever-increasing Internet traffic that requires higher data rate, larger switch size, and efficient multicasting.