ppxscal/embedding_network huggingface dataset:
Motion Compensated Interpolation as a New Inter Coding Mode for 8x8 Macroblock Partitions in H.264/AVC B Slices
Authors: Stefaan Mys, Jürgen Slowack, Jozef Škorupa, Peter Lambert, Rik Walle
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Thanks to a lot of new or improved coding tools, the H.264/AVC video coding standard achieves up to twice as good compression ratios over its predecessors. Unfortunately, many of these new coding tools come with the cost of a considerable extra amount of bits needed to send motion vectors to the decoder. Especially at low bit rates, this overhead is an important drawback. In this paper, a new inter coding mode for 8x8 macroblock partitions in B slices is proposed. The mode is based on motion compensated interpolation, a commonly used technique in the world of distributed video coding. Since motion compensated interpolation allows both encoder and decoder to find the same motion vector, no bits need to be spent on coding this motion vector. Experimental results show that introducing the new coding mode can achieve a bit rate gain of up to 3.03%, especially at low bit rates.
Probabilistic Discovery of Semantically Diverse Content in MANETs
Authors: Andronikos Nedos, Kulpreet Singh, Raymond Cunningham, Siobhán Clarke
Venue: IEEE Transactions on Mobile Computing (2009)

Mobile ad hoc networks rely on the opportunistic interaction of autonomous nodes to form networks without the use of infrastructure. Given the radically decentralized nature of such networks, their potential for autonomous communication is significantly improved when the need for a priori consensus among the nodes is kept to a minimum. This paper addresses an issue within the domain of semantic content discovery, namely, its current reliance on the preexisting agreement between the schema of content providers and consumers. We present OntoMobil, a semantic discovery model for ad hoc networks that removes the assumption of a globally known schema and allows nodes to publish information autonomously. The model relies on the randomized dissemination and replication of metadata through a gossip protocol. Given schemas with partial similarities, the randomized metadata dissemination mechanism facilitates eventual semantic agreement and provides a substrate for the scalable discovery of content. A discovery protocol can then utilize the replicated metadata to identify content within a predictable number of hops using semantic queries. A stochastic analysis of the gossip protocol presents the different trade-offs between discoverability and replication. We evaluate the proposed model by comparing OntoMobil against a broadcast-based protocol and demonstrate that semantic discovery with proactive replication provides good scalability properties, resulting in a high discovery ratio with less overhead than a reactive nonreplicated discovery approach.
Speech Emotion Perception by Human and Machine
Authors: Szabolcs Levente Tóth, David Sztahó, Klára Vicsi
Venue: Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction: COST Action 2102 International Conference, Patras, Greece, October 29-31, 2007. Revised Papers (2008)

The human speech contains and reflects information about the emotional state of the speaker. The importance of research of emotions is increasing in telematics, information technologies and even in health services. The research of the mean acoustical parameters of the emotions is a very complicated task. The emotions are mainly characterized by suprasegmental parameters, but other segmental factors can contribute to the perception of the emotions as well. These parameters are varying within one language, according to speakers etc. In the first part of our research work, human emotion perception was examined. Steps of creating an emotional speech database are presented. The database contains recordings of 3 Hungarian sentences with 8 basic emotions pronounced by nonprofessional speakers. Comparison of perception test results obtained with database recorded by nonprofessional speakers showed similar recognition results as an earlier perception test obtained with professional actors/actresses. It was also made clear, that a neutral sentence before listening to the expression of the emotion pronounced by the same speakers cannot help the perception of the emotion in a great extent. In the second part of our research work, an automatic emotion recognition system was developed. Statistical methods (HMM) were used to train different emotional models. The optimization of the recognition was done by changing the acoustic preprocessing parameters and the number of states of the Markov models.
Dynamic security: an agent-based model for airport defense
Authors: William E. Weiss
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The Department of Homeland Security (DHS) shifted the focus of airport security in 2004 to incorporate the need to continuously and rapidly adapt security to shifting threats. MITRE is developing a Dynamic Security Airport Simulation as part of a MITRE-sponsored research project in which attacker and defense behavior in the airport environment are modeled. The simulation accepts threat vectors (path-weapon combinations) from other software or the user and models the performance of the airport defense against those threat vectors. The simulation includes two intelligent agents: the attacker and the defense. These agents model the behavior of those two entities; their logic includes both decision making and learning.
Negation-Limited Inverters of Linear Size
Authors: Hiroki Morizumi, Genki Suzuki
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

An inverter is a circuit which outputs &not;x 1, &not;x 2, ..., &not;x n for any Boolean inputs x 1, x 2, ..., x n . Beals, Nishino and Tanaka have given a construction of an inverter which has size O(nlogn) and depth O(logn) and uses &lceil;log(n + 1) &rceil; NOT gates. In this paper we give a construction of an inverter which has size O(n) and depth log1 + o(1) n and uses log1 + o(1) n NOT gates. This is the first negation-limited inverter of linear size using only o(n) NOT gates.
New Research on Harmonics and Reactive Currents Detecting and Its Suppression with ANN in Single-Phase Circuit
Authors: Wenjin Dai, Qingsheng Lin, Yongtao Dai
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

To avoid the deficiencies which exist in the single-phase circuit for detecting harmonics and reactive currents, this paper presents a new detecting method after analysing the operating principle of the single-phase shunt active power filter(SAPF). This new detecting method omits the complex coordinate transform of traditional ip-iq detecting method, which can easily obtain sine and cosine signal that in phase of the power supply voltage that do not need PLL circuit. Meanwhile, this new detecting method also proposes the PID negative feedback which can quicken the dynamic response speed. At the same time, this paper also presents a new control method for harmonic and reactive power compensation with an artificial neural network (ANN) controller and a new control algorithm to eliminate harmonics, which makes actual output current of active power filter can accurately track the change of instruction current. Finally, this paper designs a SAPF that compensate harmonics and reactive currents for the single-phase circuit. Through simulation study with Matlab, the simulation results illustrate that the SAPF has a good performance in harmonic suppression and reactive power compensation.
Fabrication of Pt/Sr2(Ta1-x,Nbx)2O7/SiO2/Si field-effect transistor for one-transistor-type ferroelectric random access memory
Authors: Ichirou Takahashi, Keita Azumi, Yasuyuki Shirai, Masaki Hirayama, Akinobu Teramoto, Shigetoshi Sugawa, Tadahiro Ohmi
Venue: Proceedings of the 6th conference on Microelectronics, nanoelectronics, optoelectronics (2007)

Sr2(Ta1-x,Nbx)2O7 (STN; x=0.3) is one of the most practical candidates for one-transistor-type ferroelectric random access memory devices. One of the most typical structures for the devices is metal-ferroelectric-insulator-semiconductor (MFIS) structure. However, the fabrication of STN on an amorphous SiO2 (insulator) is difficult. In particular, in the case of STN, because its crystallization annealing temperature is 950°C, the metal elements of STN and Si react with each other during crystallization annealing. As a result, perovskite STN cannot be fabricated. We have already developed STN film formation technologies on SiO2 by ion-bombardment-assisted sputtering and introducing a thin STN seed layer treated by oxygen radicals using a microwave-excited plasma system. The IrO2/perovskite STN (140 nm)/STN seed layer (10 nm)/SiO2 (10 nm)/Si device shows square hysteresis curves and a memory window of 1.7 V under an 8 V writing operation. Furthermore, we have fabricated and operated the Pt/STN (140 nm)/STN seed layer (10 nm)/SiO2/Si field-effect transistor for the first time. The drain current (Id)-gate voltage (Vd) [Id-Vg] characteristics show counterclockwise hysteresis curves due to ferroelectric polarization switching.
Agent mobility architecture based on IEEE-FIPA standards
Authors: J. Cucurull, R. Martí, G. Navarro-Arribas, S. Robles, B. Overeinder, J. Borrell
Venue: Computer Communications (2009)

Mobile agents are autonomous software entities driven by a set of goals and tasks. Reactivity, social ability, autonomy, the ability to move to different network locations, and the weak agent notion of proactiveness, allow for autonomous processing of distributed information according to their environment (context awareness). Although agent mobility has been devised for homogeneous environments, deployment of agent mobility in heterogeneous environments has been hindered by the absence of a common set of interoperation rules and ontologies for different agent middlewares. In this article, an agent migration model based on the communication standards of the IEEE-FIPA organisation is proposed. The approach described encompasses the definition of several specifications to achieve interoperability in the migration process in heterogeneous environments. The model provides a basic and extensible common migration process, which is flexible enough to support different kinds of migration methods and future upgrades. It is completely independent of any specific middleware implementation.
Holographic algorithms: The power of dimensionality resolved
Authors: Jin-Yi Cai, Pinyan Lu
Venue: Theoretical Computer Science (2009)

Valiant's theory of holographic algorithms is a novel methodology to achieve exponential speed-ups in computation. A fundamental parameter in holographic algorithms is the dimension of the linear basis vectors. We completely resolve the problem of the power of higher dimensional bases. We prove that 2-dimensional bases are universal for holographic algorithms.
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
Authors: Marko Bertogna, Michele Cirinei, Giuseppe Lipari
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

Research on real-time scheduling algorithms for multiprocessor systems is a hot topic, due to the recent popularity of multicore hardware platforms. When executing applications with dynamic requirements on symmetric multiprocessor platforms, a possibility is to use global scheduling, where ready tasks are inserted in a single system-wide queue and migration from one processor to another is allowed during task lifetime. This paper addresses the problem of schedulability analysis of globally scheduled periodic and sporadic task sets. First, a general method to derive schedulability conditions for multiprocessor real-time systems will be presented. The analysis will be applied to two typical scheduling algorithms: Earliest Deadline First (EDF) and Fixed Priority (FP). Then, the derived schedulability conditions will be tightened, refining the analysis with a simple and effective technique that significantly improves the percentage of accepted task sets. The effectiveness of the proposed test is shown through an extensive set of synthetic experiments.
A Balanced Energy Consumption Routing with Receiving Cost for Wireless Sensor Networks
Authors: Yuyao He, Xue Li, Shiyan Xu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Due to the receiving energy consumption on wireless sensor networks routing algorithm has not been considered in past studies, we show in this paper a network model considering both the transmitting and receiving cost. Based on the model, the authors present a new routing algorithm which provides the path with sufficient energy to complete the transmission task. The new algorithm prunes the network by shortest path computations and resets the cost weight by a cost evaluation function which could balance the energy consumption and maximize the life of the wireless sensor network. The simulation results show that the routing algorithm is superior to CMAX algorithm in maintaining the network and balancing energy consumption.
Bayesian clustering of flow cytometry data for the diagnosis of B-Chronic Lymphocytic Leukemia
Authors: John Lakoumentas, John Drakos, Marina Karakantza, George C. Nikiforidis, George C. Sakellaropoulos
Venue: Journal of Biomedical Informatics (2009)

In the rapidly advancing field of flow cytometry, methodologies facilitating automated clinical decision support are increasingly needed. In the case of B-Chronic Lymphocytic Leukemia (B-CLL), discrimination of the various subpopulations of blood cells is an important task. In this work, our objective is to provide a useful paradigm of computer-based assistance in the domain of flow-cytometric data analysis by proposing a Bayesian methodology for flow cytometry clustering. Using Bayesian clustering, we replicate a series of (unsupervised) data clustering tasks, usually performed manually by the expert. The proposed methodology is able to incorporate the expert's knowledge, as prior information to data-driven statistical learning methods, in a simple and efficient way. We observe almost optimal clustering results, with respect to the expert's gold standard. The model is flexible enough to identify correctly non canonical clustering structures, despite the presence of various abnormalities and heterogeneities in data; it offers an advantage over other types of approaches that apply hierarchical or distance-based concepts.
Electronic governance in Europe
Authors: Madeleine Siösteen Thiel, Urban Funered
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

This panel will critically examine some major e-Government initiatives in Europe from both a Eurocentric perspective and a more general (non-European) dimension. From the European perspective panelists will deliberate on impact and effectiveness of these programs in terms of EU goals, such as improved competitiveness of member states, creation of jobs for EU citizens and innovation in governance through Web 2.0 technologies. For better insights into outcomes and observations, the panel will debate on reasons for poor uptake of e-services and how the utilization of these services can be improved through greater cross-border cooperation and focused research. From a more general perspective, the possibility of transferring innovations and experiences from these projects outside Europe will be discussed. Panelists include practitioners and researchers from Europe.
Distributed Skyline Retrieval with Low Bandwidth Consumption
Authors: Lin Zhu, Yufei Tao, Shuigeng Zhou
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

We consider skyline computation when the underlying dataset is horizontally partitioned onto geographically distant servers \color{red} that are connected to the Internet. \color{black} The existing solutions are not suitable for our problem, because they have at least one of the following drawbacks: (i) applicable only to distributed systems adopting vertical partitioning or restricted horizontal partitioning, (ii) effective only when each server has limited computing and communication abilities, and (iii) optimized only for skyline search in subspaces but inefficient in the full space. This paper proposes an algorithm, called {\em feedback-based distributed skyline} (FDS), to support arbitrary horizontal partitioning. \color{red} FDS aims at minimizing the network bandwidth, measured in the number of tuples transmitted over the network. \color{black} The core of FDS is a novel feedback-driven mechanism, where the coordinator iteratively transmits certain feedback to each participant. Participants can leverage such information to prune a large amount of local data, which otherwise would need to be sent to the coordinator. Extensive experimentation confirms that FDS significantly outperforms alternative approaches in both effectiveness and progressiveness.
On the enhanced hyper-hamiltonian laceability of hypercubes
Authors: Tsung-Han Tsai, Tzu-Liang Kung, Jimmy J. M. Tan, Lih-Hsing Hsu
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

A bipartite graph is hamiltonian laceable if there exists a hamiltonian path between any two vertices that are in different partite sets. A hamiltonian laceable graph G is said to be hyper-hamiltonian laceable if, for any vertex v of G, there exists a hamiltonian path of G - {v} joining any two vertices that are located in the same partite set different from that of v. In this paper, we further improve the hyper-hamiltonian laceability of hypercubes by showing that, for any two vertices x, y from one partite set of Qn, n ≥ 4, and any vertex w from the other partite set, there exists a hamiltonian path H of Qn - {w} joining x to y such that dH(x, z) = l for any vertex z ε V (Qn) - {x,y,w} and for every integer l satisfying both dQn(x, z) ≤ l ≤ 2n - 2 - dQn(z; y) and 2|(l - dQn(x; z)). As a consequence, many attractive properties of hypercubes follow directly from our result.
Compiler Techniques for Efficient Communications in Circuit Switched Networks for Multiprocessor Systems
Authors: Shuyi Shao, Alex K. Jones, Rami Melhem
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

In this paper we explore compiler techniques for achieving efficient communications on circuit switching interconnection networks. We propose a compilation framework for identifying communication patterns and compiling these patterns as network configuration directives. This has the potential of providing significant performance benefits when connections can be established in the network prior to the actual communications. The framework includes a flexible and powerful communication pattern representation scheme that captures the property of communication patterns and allows manipulation of these patterns. In this way, communication phases can be identified within the application. Additionally, we extend the classification of static and dynamic communications to include persistent communications. Persistent communications are a subclass of dynamic communications that remain unchanged for large segments of the application execution. An experimental compiler has been developed to implement the framework. This compiler is capable of detecting both static and persistent communications within an application. We show that for the NAS Parallel Benchmarks, 100% of the point-to-point communications can be classified as either static or persistent and 100% of the collectives are either static or persistent with the exception of IS. Simulation-based performance analysis demonstrates the benefit of using our compiler techniques for achieving efficient communications in multiprocessor systems.
Casting an Object with a Core
Authors: Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa
Venue: Algorithmica (2009)

This paper addresses geometric problems in manufacturing objects by casting. In casting, molten material is poured into the cavity of the cast and allowed to solidify, after which the cast is removed. The cast has two cast parts to be removed in opposite directions. To manufacture more complicated objects, the cast may also have a side core to be removed in a direction skewed to the removal directions for the cast parts. We address the following problem: Given an object and the removal directions for the cast parts and the side core, can a cast be constructed such that the cast parts and the side core can be removed in the directions specified without colliding with the object or each other? We give necessary and sufficient conditions for the problem, as well as a discrete algorithm to perform the test in O(n 3log&#x2009;n) time for polyhedral objects, where n is the number of vertices, edges, and facets. If the test result is positive, a cast with complexity O(n 3) can be constructed within the same time bound. We also present an example to show that a cast may have &#x03a9;(n 3) complexity in the worst case.
Performance evaluation of the MP/C
Authors: Bruce W. Arden, Ran Ginosar
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The performance of the MP/C, a multiprocessor/multicomputer architecture, is evaluated by means of deterministic and probabilistic techniques and simulations. The MP/C is examined in two different applications, as a tree machine and as a multiprogramming general-purpose system. The second application of the MP/C is compared with a star architecture. The evaluation suggests that the MP/C is very effective for certain special applications, such as tree algorithms, and worst-case analysis shows that its performance is acceptable even for general purpose computations.
Turing-Complete Subclasses of CHR
Authors: Jon Sneyers
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Interesting subclasses of CHR are still Turing-complete: CHR with only one kind of rule, with only one rule, and propositional refined CHR. This is shown by programming a simulator of Turing machines (or Minsky machines) within those subclasses. Single-headed CHR without host language and propositional abstract CHR are not Turing-complete.
Small weak epsilon-nets
Authors: Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky
Venue: Computational Geometry: Theory and Applications (2009)

Given a set P of points in the plane, a set of points Q is a weak @e-net with respect to a family of sets S (e.g., rectangles, disks, or convex sets) if every set of S containing @e|P| points contains a point of Q. In this paper, we determine bounds on @e"i^S, the smallest epsilon that can be guaranteed for any P when |Q|=i, for small values of i.
Guest Editor's Introduction: Capturing Design Knowledge
Authors: Uwe Zdun
Venue: IEEE Software (2009)

Capturing software design knowledge is important because it tends to evaporate as software systems evolve. This has severe consequences for many software projects. To counteract this phenomenon, effective, systematic documentation of design knowledge is important. However, many proposed approaches for capturing design knowledge are still experimental or in an early-adoption stage. In this article, we discuss existing and new approaches to deal with parts of the knowledge evaporation problem.