ppxscal/embedding_network huggingface dataset:
Research on Algorithms of Neural Network Ensemble with Multi-dsp Mixture Structure
Authors: Tingfa Xu, Guoqiang Ni
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

A neural network ensemble algorithm used in automatic target recognition (ATR) was designed based on multi-DSP mixture structure. It is formed a same type classifier under different size and initial condition by BP neural networks, and map every output of neural network into posteriori probability, then make weighted summation and judge. Real-time recognition was run by the neural networks ensemble system. The result showed that statistic recognition rate was up to 97 percent for 8 type object. The processing was finished in 30 ms. The recognition rate was better than single neural networks obviously.
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes
Authors: Arnoldo Jose Muller Molina, Takeshi Shinohara
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementation of a tool that matches open source programs embedded inside pirate programs. The problem of binary program matching can be approximated by analyzing the similarity of program fragments generated from low-level instructions. These fragments are syntax trees that can be compared by using a tree distance function. Tree distance functions are generally very costly. Sequentially calculating the similarities of fragments with them becomes prohibitively expensive. In this paper we experimentally demonstrate how a spatial index can be used to substantially increase matching performance. These techniques allowed us to do exhaustive experiments that confirmed previous results on the subject. The paper also introduces the novel idea of using information retrieval techniques for calculating the similarity of bags of program fragments. It is possible to identify programs even when they are heavily obfuscated with the innovative approach described here.
A System Executive for Real-Time Microcomputer Programs
Authors: Walter Heath
Venue: IEEE Micro (1984)

Don't want to use an off-the-shelf system executive but lack the resources to develop one from scratch? This description will help you build your own custom package. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
SGSP - A Workflow Based Middleware for Service-Oriented Computing
Authors: Yi Wang, Minglu Li, Jian Cao, Lin Chen, Feilong Tang, Xinhua Lin
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Since many of the key techniques now being applied in building services and a lot of service-based applications were developed, Service-Oriented Computing (SOC) has become the main trend of distributed computing research field. In this paper, we proposes a workflow-based middleware named ShanghaiGrid Support Platform (SGSP) for SOC in the Grid environment, which provides a grid toolkit for ShanghaiGrid application developers and specific grid constructors. The toolkit can access, invoke and compose diverse services conveniently. The architecture and function of the each component of toolkit have been introduced in the paper. We also use an image processing application to validate the feasibility and efficiency of SGSP.
Fuzzy Sliding Mode Controller for Uncertain Chen_s Chaotic System
Authors: Shaocheng Qu, Xiaoyan Wang, Meijing Gong, Hao Qu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

A fuzzy robust sliding mode controller (FSMC) based on T-S model is presented to stabilize uncertain Chen's chaotic system. The difficulty of constructing a robust sliding mode plane is alleviated by using a novel virtual state feedback. The overall asymptotical stability of the uncertain chaotic systems is guaranteed. High gain to suppress the parameter uncertainties and external disturbances is avoided by tradeoff of T-S fuzzy control. Meanwhile, The controller does not need any complicated state transformation as does the traditional sliding mode control strategy. Theoretical analysis and numerical simulations illustrate the effectiveness and feasibility of the proposed strategy.
A Wii remote, a game engine, five sensor bars and a virtual reality theatre
Authors: Torben Schou, Henry J. Gardner
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

The Nintendo Wii Remote is having a huge impact on the computer games industry. This paper describes a project which is integrating this controller into a game environment in a multi-wall virtual reality theatre. Aspects considered include interaction taxonomies of the Wii controller, the extension of driver software to have the Wii controller deal with multiple Sensor Bars at once, and the porting of the game engine into the virtual reality theatre.
Assigning semantics to partial tree-pattern queries
Authors: Dimitri Theodoratos, Xiaoying Wu
Venue: Data Knowledge Engineering (2008)

The wide adoption of XML has increased the interest on data models that are based on tree-structured data. Querying capabilities are provided through tree-pattern queries (TPQs). The need for querying tree-structured data sources when their structure is not fully known, and the need to integrate multiple data sources with different tree structures have driven, recently, the suggestion of query languages that relax the complete specification of a tree pattern. Assigning semantics to the queries of these languages so that they return meaningful answers is a challenging issue. In this paper, we introduce a query language which allows the specification of partial tree-pattern queries (PTPQs). The structure in a PTPQ can be flexibly specified fully, partially or not at all. We define index graphs which summarize the structural information of data trees. Using index graphs, we show that PTPQs can be evaluated through the generation of an equivalent set of ''complete'' TPQs. We suggest an original approach that exploits the set of complete TPQs of a PTPQ to assign meaningful semantics to the PTPQ language. In contrast to previous approaches that operate locally on the data to compute meaningful answers (usually by computing lowest common ancestors), our approach operates globally on index graphs to detect meaningful complete TPQs. We implemented and experimentally evaluated our approach on DBLP-based data sets with irregularities. Its comparison to previous ones shows that it succeeds in finding all the meaningful answers when the others fail (perfect recall). Further, it outperforms approaches with similar recall in excluding meaningless answers (better precision). Finally, it is superior to and scales better than the only previous approach that allows for structural constraints in the queries. Our approach generates TPQs and therefore, it can be easily implemented on top of an XQuery engine.
A Stable Clustering Algorithm for Highly Mobile Ad Hoc Networks
Authors: Fatiha Djemili Tolba, Damien Magoni, Pascal Lorenz
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

The dynamic topology of ad hoc networks is an important issue on which a lot of research is carried out. Because of higher speeds of movement and networks of larger scale, the algorithms of auto-organization and clustering may be inefficient. Therefore, we propose a fully distributed clustering algorithm for mobile ad hoc networks in which the nodes can move at higher speeds. The main objectives of this algorithm consists in reducing the reconstruction of the topology and stabilizing it as a long time as possible. This clustering algorithm can be used by several routing algorithms for ad hoc networks. Under proper simulations, we show that optimal cluster head characteristics: connectivity, energy and mobility, lead to a stable topology in terms of reconfiguration frequency.
Using information retrieval to support design of incremental change of software
Authors: Denys Poshyvanyk, Andrian Marcus
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

The proposed research defines an approach to combine Information Retrieval based analysis of the textual information embedded in software artifacts with program static and dynamic analysis techniques to support key activities of the incremental change of software, such as concept and feature location.
Supporting creativity with awareness in distributed collaboration
Authors: Umer Farooq, John M. Carroll, Craig H. Ganoe
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Based on qualitative analysis of three groups collaborating on a research task in a distributed setting, we identify four breakdowns in creativity: (1) Minority ideas were under-considered; (2) Novel ideas were easily lost; (3) There was a lack of critical evaluation of perspectives; (4) Reflexivity was weak during convergence. We propose two design strategies, illustrated with mock-ups, to support creativity with awareness: (1) Automatically summarize and recommend ideational activities from system logs; (2) Allow collaborators to enter status of work activity, making these activity updates visible on social and temporal dimensions. Our analysis also suggests an integrated framework of metrics to evaluate creativity as a long-term collaborative activity.
Programming-in-the-Large Versus Programming-in-the-Small
Authors: F. DeRemer
Venue: IEEE Transactions on Software Engineering (1976)

We distinguish the activity of writing large programs from that of writing small ones. By large programs we mean systems consisting of many small programs (modules), usually written by different people.
An efficient algorithm for approximate biased quantile computation in data streams
Authors: Qi Zhang, Wei Wang
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

We propose an efficient algorithm for approximate biased quantile computation in large data streams. Our algorithm computes decomposable biased quantile summaries on fixed sized blocks and dynamically maintains the biased quantile summary for the entire stream as the exponential histogram over the block-wise quantile summaries. The algorithm is computationally efficient and achieves an amortized computational cost of O(log(1⁄∈log(∈n))) and a space requirement of O(log3∈n↬∈). Our algorithm does not assume prior knowledge of the stream sizes or the range of data values in the streams. In practice, our algorithm is able to efficiently maintain summaries over large data streams with over tens of millions of observations and achieves significant performance improvement over prior algorithms.
Hybrid Stereo Sensor with Omnidirectional Vision Capabilities: Overview and Calibration Procedures
Authors: Stefano Cagnoni, Monica Mordonini, Luca Mussi, Giovanni Adorni
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper, we present a compact hybrid video sensor that combines perspective and omnidirectional vision to achieve a 360 field of view, as well as high-resolution images. Those characteristics, in association with 3D metric reconstruction capabilities, are suitable for vision tasks such as surveillance and obstacle detection for autonomous robot navigation. We describe the sensor calibration procedure, with particular regard to mirror-to-camera positioning. We also present some results obtained in testing the accuracy of 3D reconstruction, which have confirmed the correctness of the calibration.
Ultradifferentiable fundamental kernels of linear partial differential operators on non-quasianalytic classes of roumieu type
Authors: Angela A. Albanese, José Bonet
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

Let P be a linear partial differential operator with coefficients in the Roumieu class ε{ω}(Ω). We prove that if P and its transposed operator tP are {ω}-hypoelliptic in Ω and surjective on the space ε{ω}(Ω), then P has a global two-sided ultradifferentiable fundamental kernel in Ω, thus extending to the Roumieu classes the well-known analogous result of B. Malgrange in the C∞ class. This result is new even for Gevrey classes.
Dynamic Predication of Indirect Jumps
Authors: José A. Joao, Onur Mutlu, Hyesoon Kim, Yale N. Patt
Venue: IEEE Computer Architecture Letters (2007)

Indirect jumps are used to implement increasingly common programming language constructs such as virtual function calls, switch-case statements, jump tables, and interface calls. Unfortunately, the prediction accuracy of indirect jumps has remained low because many indirect jumps have multiple targets that are difficult to predict even with specialized hardware. This paper proposes a new way of handling hard-to-predict indirect jumps: dynamically predicating them. The compiler identifies indirect jumps that are suitable for predication along with their control-flow merge (CFM) points. The microarchitecture predicates the instructions between different targets of the jump and its CFM point if the jump turns out to be hardto-predict at run time. We describe the new indirect jump predication architecture, provide code examples showing why it could reduce the performance impact of jumps, derive an analytical cost-benefit model for deciding which jumps and targets to predicate, and present preliminary evaluation results.
2007 Special Issue: An architectural model of conscious and unconscious brain functions: Global Workspace Theory and IDA
Authors: Bernard J. Baars, Stan Franklin
Venue: Neural Networks (2007)

While neural net models have been developed to a high degree of sophistication, they have some drawbacks at a more integrative, ''architectural'' level of analysis. We describe a ''hybrid'' cognitive architecture that is implementable in neuronal nets, and which has uniform brainlike features, including activation-passing and highly distributed ''codelets,'' implementable as small-scale neural nets. Empirically, this cognitive architecture accounts qualitatively for the data described by Baars' Global Workspace Theory (GWT), and Franklin's LIDA architecture, including state-of-the-art models of conscious contents in action-planning, Baddeley-style Working Memory, and working models of episodic and semantic longterm memory. These terms are defined both conceptually and empirically for the current theoretical domain. The resulting architecture meets four desirable goals for a unified theory of cognition: practical workability, autonomous agency, a plausible role for conscious cognition, and translatability into plausible neural terms. It also generates testable predictions, both empirical and computational.
Basic generated universal fuzzy measures
Authors: R. Mesiar, A. Mesiarová-Zemánková, L'. Valášková
Venue: International Journal of Approximate Reasoning (2007)

The concept of basic generated universal fuzzy measures is introduced. Special classes and properties of basic generated universal fuzzy measures are discussed, especially the additive, the symmetric and the maxitive case. Additive (symmetric) basic universal fuzzy measures are shown to correspond to the Yager quantifier-based approach to additive (symmetric) fuzzy measures. The corresponding fuzzy integral-based aggregation operators are introduced, including the generated OWA operators.
Enhanced tracking and recognition of moving objects by reasoning about spatio-temporal continuity
Authors: Brandon Bennett, Derek R. Magee, Anthony G. Cohn, David C. Hogg
Venue: Image and Vision Computing (2008)

A framework for the logical and statistical analysis and annotation of dynamic scenes containing occlusion and other uncertainties is presented. This framework consists of three elements; an object tracker module, an object recognition/classification module and a logical consistency, ambiguity and error reasoning engine. The principle behind the object tracker and object recognition modules is to reduce error by increasing ambiguity (by merging objects in close proximity and presenting multiple hypotheses). The reasoning engine deals with error, ambiguity and occlusion in a unified framework to produce a hypothesis that satisfies fundamental constraints on the spatio-temporal continuity of objects. Our algorithm finds a globally consistent model of an extended video sequence that is maximally supported by a voting function based on the output of a statistical classifier. The system results in an annotation that is significantly more accurate than what would be obtained by by-frame evaluation of the classifier output. The framework has been implemented and applied successfully to the analysis of team sports with a single camera.
MacZ - A Quality-of-Service MAC Layer for Ad-hoc Networks
Authors: Philipp Becker, Reinhard Gotzhein, Thomas Kuhn
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

In this paper, we present a new MAC layer called MacZ, specifically devised for flexible QoS support in mobile adhoc networks. MacZ provides multi-hop tick synchronization, network-wide medium slotting, contention-free transmission with global reservations, contention-based transmission with priorities, and is robust against topology changes. We describe the main functionalities of MacZ, show results of performance simulations that provide evidence for the effectiveness of the QoS mechanisms, and discuss related MAC layers.
Overview of AI3 network: design and applications of satellite network
Authors: Teruaki Yokoyama, Shoko Mikawa, Jun Takei, Kenjiro Cho, Suguru Yamaguchi, Jun Murai
Venue: Proceedings of the 2007 workshop on Networked systems for developing regions (2007)

Many developing countries are not gaining benefits from the Internet as the network infrastructure has not yet been built due to the economic or administrative restrictions of these regions. Asian Internet Interconnection Initiatives (AI3) has been developing a research consortium of 29 partner institutions in 13 countries utilizing an Internet infrastructure over a satellite links. The project aims to develop partnerships and human networks to foster researchers within the regions to carry out research on the satellite Internet and to develop their regions. We have successfully conducted productive research and also developed a distance-learning environment as a result of more than a decade of experiments. This paper aims to share the operational know-how and results of research from AI3's activities to construct a network and applications that would support developing regions.
Controlling the Conversation
Authors: David Alan Grier
Venue: Computer (2007)

American automakers adopted computer controls to deal with complicated engineering problems only when pushed by forces beyond their control.
Massively multiplayer online role-playing games: the past, present, and future
Authors: Leigh Achterbosch, Robyn Pierce, Gregory Simmons
Venue: Computers in Entertainment (CIE) (2008)

Massively multiplayer online role-playing games (MMORPGs) are emerging in the computer game industry as a very popular genre. These games have existed since the late 1990s, but in the last few years the market has become increasingly strong. This relatively new genre is attracting a widespread audience, bringing together those who previously enjoyed both pen and paper and computer role-playing games, as well as those who enjoy socializing with other players in a virtual environment. Game developers see MMORPGs as a potentially profitable business due to its widespread appeal, but the reality is that only a small percentage of MMORPGs that are released become a success [Kosak 2006]. This article attempts to determine the many aspects that make a successful MMORPG; it also attempts to ascertain what new and innovative features are expected by the users from the next generation of MMORPGs. This is achieved by looking at and discussing past literature and surveying the MMORPG community's perception of previous and current MMORPGs, as well as their expectations of the next generation. An online survey attracted 122 participants to provide their perceptions of current and past MMORPGs. This article determines and outlines the respondents' preferences in the MMORPG genre, discussing what implications these could have on its future. The survey also gave insight into the respondents' expectations of the future of MMORPGs. We conclude this article with a discussion of aspects of current MMORPGs that the participants would like improved, as well as new features they would like incorporated into the next generation of games.
The Open Channel
Authors: J. Inglis
Venue: Computer (1976)

The Open Channel is exactly what the name implies: a forum for the free exchange of technical ideas. Hold your contributions to one page maximum in the final magazine format (about 1000 words-less, if you want to include illustrations). The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
One-way analysis of variance with long memory errors and its application to stock return data
Authors: Jaechoul Lee, Kyungduk Ko
Venue: Applied Stochastic Models in Business and Industry (2007)

Recent empirical results indicate that many financial time series, including stock volatilities, often have long-range dependencies. Comparing volatilities in stock returns is a crucial part of the risk management of stock investing. This paper proposes two test statistics for testing the equality of mean volatilities of stock returns using the analysis of variance (ANOVA) model with long memory errors. They are modified versions of the ordinary F statistic used in the ANOVA models with independently and identically distributed errors. One has a form of the ordinary F statistic multiplied by a correction factor, which reflects slowly decaying autocorrelations, that is, long-range dependence. The other is a test statistic such that the degrees of freedom of the denominator in the ordinary F test statistic is calibrated by the so-called effective sample size. Empirical sizes and powers of the proposed test statistics are examined via Monte Carlo simulation. An application to German stock returns is presented. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Five-key text input using rhythmic mappings
Authors: Christine Szentgyorgyi, Edward Lank
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

Novel key mappings, including chording, character prediction, and multi-tap, allow the use of fewer keys than those on a conventional keyboard to enter text. In this paper, we explore a text input method that makes use of rhythmic mappings of five keys. The keying technique averages 1.5 keystrokes per character for typical English text. In initial testing, the technique shows performance similar to chording and other multi-tap techniques, and our subjects had few problems with basic text entry. Five-key entry techniques may have benefits for text entry in multi-point touch devices, as they eliminate targeting by providing a unique mapping for each finger.