ppxscal/embedding_network huggingface dataset:
Teacher-Directed Learning with Mixture of Experts for View-Independent Face Recognition
Authors: Reza Ebrahimpour, Ehsanollah Kabir, Mohammad Reza Yousefi
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

We propose two new models for view-independent face recognition, which lies under the category of multiview approaches. We use the so-called "mixture of experts" (MOE) in which, the problem space is divided into several subspaces for the experts, and then the outputs of experts are combined by a gating network to form the final output. Basically, our focus is on the way that the face space is partitioned by MOE. In our first model, experts of MOE structure are not biased in any way to prefer one class of faces to another, in other words, the gating network learns a partition of input face space and trusts one expert in each of these partitions; we call this method "self-directed partitioning". In our second model, we attempt to direct the experts to specialize in predetermined areas of face space by developing teacher-directed learning methods for MOE. In this model, by including teacher information about the pose of input face image in the training phase of networks, each expert is directed to learn faces of a specific pose class, so referred to as "teacher-directed partitioning". Thus, in our second model, instead of allowing the MOE to partition the face space on its own way, it is quantized according to a number of predetermined views and MOE is trained to adapt to such space partitioning. The experimental results support our claim that directing the mixture of experts to a predetermined partitioning of face space is a more beneficial way of using MOE for view-independent face recognition.
Fast Algorithms for Computing Tree LCS
Authors: Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

The LCS of two rooted, ordered, and labeled trees F and G is the largest forest that can be obtained from both trees by deleting nodes. We present algorithms for computing tree LCS which exploit the sparsity inherent to the tree LCS problem. Assuming G is smaller than F, our first algorithm runs in time $O(r\cdot {\rm height}(F) \cdot {\rm height}(G)\cdot \lg\lg |G|)$, where r is the number of pairs (v ¿ F, w ¿ G) such that v and w have the same label. Our second algorithm runs in time $O(L r \lg r \cdot \lg\lg|G|)$, where L is the size of the LCS of F and G. For this algorithm we present a novel three dimensional alignment graph. Our third algorithm is intended for the constrained variant of the problem in which only nodes with zero or one children can be deleted. For this case we obtain an $O(r h \lg \lg|G|)$ time algorithm, where h = height(F) + height(G).
A Concept-Driven Construction of the Mondex Protocol Using Three Refinements
Authors: Gerhard Schellhorn, Richard Banach
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

The Mondex case study concerns the formal development and verification of an electronic purse protocol. Several groups have worked on its specification and mechanical verification, their solutions being (as were ours previously), either one big step or several steps motivated by the task's complexity. A new solution is presented that is structured into three refinements, motivated by the three concepts underlying Mondex: a message protocol to transfer money over a lossy medium, protection against replay attacks, and uniqueness of transfers using sequence numbers. We also give an improved proof technique based on our theoretical results on verifying interleaved systems.
Panels at MODELS 2008
Authors: Sudipto Ghosh
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

Domain-specific modeling languages (DSMLs) are designed to provide precise abstractions of domain-specific constructs. Models for complex systems typically do not fit neatly within a single domain, however. Moreover, capturing all important aspects of such a system requires developing multiple models using different DSMLs. This panel will explore key challenges and promising solutions associated with combining DSML models into multi-models.
On Accepting Networks of Splicing Processors of Size 3
Authors: Remco Loos
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

In this paper, we show that accepting networks of splicing processors (ANSPs) of size 3 are computationally complete. Moreover, we prove that they can decide all languages in NP in polynomial time. The previous lower bound for both issues was 7. Since, by its definition, ANSPs need at least 2 nodes for any non-trivial computation, we leave only one open case. We also prove the following normal form: For any ANSP there exists an equivalent ANSP without output filters.
MultiStream A Cross-Platform Display Sharing System Using Multiple Video Streams
Authors: Yong Liu, Otto J. Anshus, Phuong H. Ha, Tore Larsen, John Markus Bjorndalen
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

For collaboration, cross-platform sharing of display content amongst desktop, laptop, handheld computers and smart phones is needed. Due to architectural and performance differences, support for sharing of display content is complex and the performance is low. By using standard media players and video stream formats we reduce or avoid several of these complexities and performance bottlenecks. We do continuous video encoding of display content, and a video server processes and distributes customized or fixed rate videos to viewers. We report on a configuration encoding a video of the display content of a laptop, streaming it to the video server, and playing it back on up to 560 clients distributed over 28 computers. The video displays on a wall-sized high-resolution tiled display. FPS is reduced by 2/3 on the laptop, but the bandwidth usage is reduced by two orders of magnitude. The CPU load on the server is below 50%.
The Digital Circuit Fault Diagnosis Interface Design and Realization Based on VXI
Authors: Liu Ying, Su Wei, Fan Tongshun
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

This paper discusses in detail the development process of general interface adapter in the digital circuit fault diagnosis system based on VXI. After introducing VXI bus, the paper gives overall description of fault diagnosis system, presents a method of solving the problem about load matching and interface matching, and realizes the function of identification to read and write on the memory of interface circuit and to control chip selection. The method of identity installation in interface circuit to be selected is to give an ID number and add a memory to interface circuit to ensure the accuracy and effectiveness. The paper also describes the method of self diagnosis in the interface circuit that is the key to whole fault diagnosis system.
Authoring interactive narratives with hypersections
Authors: Jean-Hugues Réty, Nicolas Szilas, Jean Clément, Serge Bouchardon
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

We present in this paper a framework for interactive narrative authoring. This framework is based on a generalized notion of section that we name hypersection. We present a graphical editor and discuss reader softwares for interactive narratives based on hypersections.
Adaptive Monitoring with Dynamic Differential Tracing-Based Diagnosis
Authors: Mohammad A. Munawar, Thomas Reidemeister, Miao Jiang, Allen George, Paul A. Ward
Venue: Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment (2008)

Ensuring high availability, adequate performance, and proper operation of enterprise software systems requires continuous monitoring. Today, most systems operate with minimal monitoring, typically based on service-level objectives (SLOs). Detailed metric-based monitoring is often too costly to use in production, while tracing is prohibitively expensive. Configuring monitoring when problems occur is a manual process.In this paper we propose an alternative: Minimal monitoring with SLOs is used to detect errors. When an error is detected, detailed monitoring is automatically enabled to validate errors using invariant-correlation models. If validated, Application-Response-Measurement (ARM) tracing is dynamically activated on the faulty subsystem and a healthy peer to perform differential trace-data analysis and diagnosis.Based on fault-injection experiments, we show that our system is effective; it correctly detected and validated errors caused by 14 out of 15 injected faults. Differential analysis of the trace data collected for 210 seconds allowed us to top-rank the faulty component in 80% of the cases. In the remaining cases the faulty component was ranked within the top-7 out of 81 components. We also demonstrate that the overhead of our system is low; given a false positive rate of one per hour, the overhead is less than 2.5%.
Genetic Algorithm and Pareto Optimum Based QoS Multicast Routing Scheme in NGI
Authors: Xingwei Wang, Pengcheng Liu, Min Huang
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

In this paper, a QoS (Quality of Service) multicast routing scheme in NGI (Next Generation Internet) is proposed based on genetic engineering and microeconomics. It can not only deal with network status inaccuracy, but also help prevent network overload and meet with intra-group fairness, trying to find a multicast routing tree with bandwidth, delay, delay jitter and error rate satisfaction degree, bandwidth availability degree and fairness degree achieved or approached Pareto optimum.
Keynote lecture: next generation broadband access networks: metro-access integration and optical-wireless convergence
Authors: Leonid G. Kazovsky, Ning Cheng
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

Because of emerging multimedia applications, such as video-on-demand, video conferencing, interactive gaming, IPTV and e-learning, bandwidth demands from end users are constantly increasing. The copper wire technologies (e.g. cable and DSL) bridging users and the Internet have been stretched to their bandwidth limits, and become the so-called first/last mile bottleneck.
Algorithms of Basic Communication Operation on the Biswapped Network
Authors: Wenhong Wei, Wenjun Xiao
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Biswapped network (BSN) is a new topology for interconnection networks in multiprocessor systems. BSN is built of 2n copies of an n-node basic network and total nodes are 2n 2. Some topological properties of BSN have been investigated, and some algorithms have been developed on the BSN such as sorting and matrix multiplication etc. In this paper, we develop algorithms for some basic communication operations--broadcast, prefix sum and data sum etc.
Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs
Authors: Masaki Murakami
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

This paper presents a formal model of concurrent systems based on graph rewriting to represent scopes of communication channel names precisely. A bipartite directed acyclic graph represents a concurrent system consists of a number of processes and messages. Each process or message corresponds to a source node of the graph. Names of communication channel in the system are sink nodes. The edges of the graph represent the scopes of the names in the system. The operational semantics of the system is given as a labeled transition system. The model presented here makes it possible to represent local names that their scope are not nested. We define an equivalence relation that two systems are equivalent not only in their behavior but in extrusions of scopes of names. We show that the equivalence relation is a congruence relation wrt prefix, new-name, replication and composition.
A Novel Image Segmentation Algorithm Based on Artificial Ant Colonies
Authors: Huizhi Cao, Peng Huang, Shuqian Luo
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

Segmentation is one of the most difficult tasks in digital image processing. This paper presents a novel segmentation algorithm, which uses a biologically inspired paradigm known as artificial ant colonies. Considering the features of artificial ant colonies, we present an extended model applied in image segmentation. Each ant in our model is endowed with the ability of memorizing a reference object, which will be refreshed when a new target is found. A fuzzy connectedness measure is adopted to evaluate the similarity between the target and the reference object. The behavior of one ant is affected by the neighboring ants and the cooperation between ants is performed by exchanging information through pheromone updating. The simulated results show the efficiency of the new algorithm, which is able to preserve the detail of the object and is insensitive to noise.
An Intrinsic Neuromodulation Model for Realizing Anticipatory Behavior in Reaching Movement under Unexperienced Force Fields
Authors: Toshiyuki Kondo, Koji Ito
Venue: Anticipatory Behavior in Adaptive Learning Systems: From Brains to Individual and Social Behavior (2007)

Regardless of complex, unknown, and dynamically-changing environments, living creatures can recognize situated environments and behave adaptively in real-time. However, it is impossible to prepare optimal motion trajectories with respect to every possible situations in advance. The key concept for realizing the environment cognition and motor adaptation is a context-based elicitation of constraints which are canalizing well-suited sensorimotor coordination. For this aim, in this study, we propose a polymorphic neural networks model called CTRNN+NM (CTRNN with neuromodulatory bias). The proposed model is applied to two dimensional arm-reaching movement control under various viscous force fields. The parameters of the networks are optimized using genetic algorithms. Simulation results indicate that the proposed model inherits high robustness even though it is situated in unexperienced environments.
Scheduling of coupled tasks and one-machine no-wait robotic cells
Authors: Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Chris Potts, Jonathan Whitehead
Venue: Computers and Operations Research (2009)

Coupled task scheduling problems have been known for more than 25 years. Several complexity results have been established in the meantime, but the status of the identical task case remains still unsettled. We describe a new class of equivalent one-machine no-wait robotic cell problems. It turns out that scheduling of identical coupled tasks corresponds to the production of a single part type in the robotic cell. We shall describe new algorithmic procedures to solve this robotic cell problem, allowing lower and upper bounds on the production time and discussing in particular cyclic production plans.
An Interaction Protocol for Agent Communication
Authors: Gemma Bel-Enguix, M. Adela Grando, M. Dolores Jiménez-López
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

In this paper, we introduce a formal-language interaction protocol for agent communication that may contribute to the building of better human-computer dialogues through a simulation of human language use. The paper centers on formal dialogue research. We introduce the definition of a formal model of dialogue based on Eco-Grammar Systems (EGS) and inspired in the Multi-Agent Protocol (MAP) language. The result is a simple formal device that could be used for the design of dialogue systems with limited human-like behaviour.
An Exact Algorithm for the Servers Allocation, Capacity and Flow Assignment Problem with Cost Criterion and Delay Constraint in Wide Area Networks
Authors: Marcin Markowski, Andrzej Kasprzak
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

The paper deals with the problem of simultaneously assignment of server's allocation, channel capacities and flow routes in the wide area network in order to minimize the criterion composed of the leasing capacity cost and the building cost of the network. An exact algorithm, based on the branch and bound method, is proposed to solve the problem. Some interesting features, observed during the computational experiments are reported.
Extraction in Coq: An Overview
Authors: Pierre Letouzey
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

The extraction mechanism of Coq allows one to transform Coq proofs and functions into functional programs. We illustrate the behavior of this tool by reviewing several variants of Coq definitions for Euclidean division, as well as some more advanced examples. We then continue with a more general description of this tool: key features, main examples, strengths, limitations and perspectives.
Modeling and Analysis of Power Distribution Networks for Gigabit Applications
Authors: Jinwoo Choi, Sung-Hwan Min, Joong-Ho Kim Madhavan Swaminathan, Wendemagegnehu Beyene
Venue: IEEE Transactions on Mobile Computing (2003)

As the operating frequency of digital systems increases and voltage swing decreases, it becomes very important to characterize and analyze power distribution networks (PDNs) accurately. This paper presents the modeling, simulation, and characterization of the PDN in a high-speed printed circuit board (PCB) designed for chip-to-chip communication at a data rate of 3.2 Gbps. The test board consists of transmitter and receiver chips wirebonded onto plastic ball grid array (PBGA) packages on a PCB. In this paper, a hybrid method has been applied for analysis which consists of the Transmission Matrix Method (TMM) in the frequency domain and Macromodeling method in the time domain. As an initial step, power/ground planes have been modeled using TMM. Then, the macromodel of the power/ground planes has been generated at the desired ports using macromodeling. Finally, the macromodel of the planes, transmission lines, and nonlinear drivers have been simulated in standard SPICE-based circuit simulators for computing power supply noise. In addition to noise computation, the self and transfer impedances of power/ground planes have been computed and the effect of decoupling capacitors on power supply noise has been analyzed. The methods discussed have been validated using hardware measurements.
ATL* Satisfiability Is 2EXPTIME-Complete
Authors: Sven Schewe
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

The two central decision problems that arise during the design of safety critical systems are the satisfiability and the model checking problem. While model checking can only be applied after implementing the system, satisfiability checking answers the question whether a system that satisfies the specification exists. Model checking is traditionally considered to be the simpler problem --- for branching-time and fixed point logics such as CTL, CTL*, ATL, and the classical and alternating time μ-calculus, the complexity of satisfiability checking is considerably higher than the model checking complexity. We show that ATL* is a notable exception of this rule: Both ATL* model checking and ATL* satisfiability checking are 2EXPTIME-complete.
Volumetric features for video event detection
Authors: Martial Hebert, Rahul Sukthankar
Venue:  (2008)

The amount of digital video has grown exponentially in recent years. We are at a nexus in time where video capture technology, computing power, storage capacity, and broadband networking have matured sufficiently to fuel an explosion in consumer videos. A key part of this ecosystem is the ability to search over vast amounts of video data. While traditional methods have relied on text, such as those extracted from closed captioning, speech analysis, or manual annotation, we would to like search based on the automated recognition of the visual events in the video. This would enable more general searches to be performed without relying on previously labeled data. We propose a method for visual event detection of human actions that occur in crowded, dynamic environments. Crowded scenes pose a difficult challenge for current approaches to video event detection because it is difficult to segment the actor from the background due to distracting motion from other objects in the scene. We propose a technique for event recognition in crowded videos that reliably identifies actions in the presence of partial occlusion and background clutter. Our approach is based on three key ideas: (1) we efficiently match the volumetric representation of an event against over-segmented spatio-temporal video volumes; (2) we augment our shape-based features using flow; (3) rather than treating an event template as an atomic entity, we separately match by parts (both in space and time), enabling robustness against occlusions and actor variability. Our experiments on human actions, such as picking up a dropped object or waving in a crowd show reliable detection with few false positives.
ICA-Based Spatio-temporal Features for EEG Signals
Authors: Sangkyun Lee, Soo-Young Lee
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

The spatio-temporal EEG features are extracted by a two-stage ICAs. First, a spatial ICA is performed to extract spatially-distributed sources, and the second ICA is introduced in temporal domain for the coefficients of spatial sources. This 2-stage method provides much better features than spatial ICA only, and is computationally more efficient than single-stage spatio-temporal ICA. Among the extracted spatio-temporal features critical features are selected for the given tasks based on Fisher criterion. The extracted features may be applicable to the classification of single-trial EEG signals.
Performance Characteristics of Flash Memory: Model and Implications
Authors: Seungjae Baek, Jongmoo Choi, Donghee Lee, Sam H. Noh
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

In this paper, we propose a model to identify the cost of block cleaning of Flash memory. The model defines three performance parameters, namely, utilization, invalidity, and uniformity and presents a formula for estimating the block cleaning cost based on these parameters. Then, we design a new modification-aware (MODA) page allocation scheme which can improve the block cleaning cost by enhancing uniformity of Flash memory. Real implementation experiments conducted on an embedded system show that the MODA scheme can reduce block cleaning time by up to 43 seconds (with an average of 10.2 seconds) compared to the traditional sequential allocation scheme that is used in YAFFS.