ppxscal/embedding_network huggingface dataset:
Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases
Authors: Arash Reyhani-Masoleh
Venue: IEEE Transactions on Computers (2006)

Recently, implementations of normal basis multiplication over the extended binary field GF(2^{m}) have received considerable attention. A class of low complexity normal bases called Gaussian normal bases has been included in a number of standards, such as IEEE [1] and NIST [2] for an elliptic curve digital signature algorithm. The multiplication algorithms presented there are slow in software since they rely on bit-wise inner product operations. In this paper, we present two vector-level software algorithms which essentially eliminate such bit-wise operations for Gaussian normal bases. Our analysis and timing results show that the software implementation of the proposed algorithm is faster than previously reported normal basis multiplication algorithms. The proposed algorithm is also more memory efficient compared with its look-up table-based counterpart. Moreover, two new digit-level multiplier architectures are proposed and it is shown that they outperform the existing normal basis multiplier structures. As compared with similar digit-level normal basis multipliers, the proposed multiplier with serial output requires the fewest number of XOR gates and the one with parallel output is the fastest multiplier.
MADL: Meta Architecture Description Language
Authors: Adel Smeda, Mourad Oussalah, Tahar Khammaci
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

As the concept of meta-classes was introduced in order to permit the manipulation of classes, we introduce the concept of meta-components, meta-connectors, and metaarchitectures to permit the manipulation and the redefinition of architectural elements (structural and behavioral). In this article we present a meta-metaarchitecture called MADL (Meta Architecture Description Language) to abstract the notions of architectures (components, connectors, architectures), hence to facilitate their manipulation, reuse, and evolution; and also to ease (hence encourage) the transformation and comparison among ADLs.
A Method for Detecting Obfuscated Calls in Malicious Binaries
Authors: Arun Lakhotia, Eric Uday Kumar, Michael Venable
Venue: IEEE Transactions on Software Engineering (2005)

Information about calls to the operating system (or kernel libraries) made by a binary executable may be used to determine whether the binary is malicious. Being aware of this approach, malicious programmers hide this information by making such calls without using the call instruction. For instance, the call addr instruction may be replaced by two push instructions and a ret instruction, the first push pushes the address of instruction after the ret instruction, and the second push pushes the address addr. The code may be further obfuscated by spreading the three instructions and by splitting each instruction into multiple instructions. This work presents a method to statically detect obfuscated calls in binary code. The idea is to use abstract interpretation to detect where the normal call-ret convention is violated. These violations can be detected by what is called an abstract stack graph. An abstract stack graph is a concise representation of all potential abstract stacks at every point in a program. An abstract stack is used to associate each element in the stack to the instruction that pushes the element. An algorithm for constructing the abstract stack graph is also presented. Methods for using the abstract stack graph are shown to detect eight different obfuscations. The technique is demonstrated by implementing a prototype tool called DOC (Detector for Obfuscated Calls).
Beyond the Flesh: Some Lessons from a Mole Cricket
Authors: Andy Clark
Venue: Artificial Life (2005)

What do linguistic symbols do for minds like ours, and how (if at all) can basic embodied, dynamical, and situated approaches do justice to high-level human thought and reason? These two questions are best addressed together, since our answers to the first may inform the second. The key move in scaling up simple embodied cognitive science is, I argue, to take very seriously the potent role of human-built structures in transforming the spaces of human learning and reason. In particular, in this article I look at a range of cases involving what I dub surrogate situations. Here, we actively create restricted artificial environments that allow us to deploy basic perception-action-reason routines in the absence of their proper objects. Examples include the use of real-world models, diagrams, and other concrete external symbols to support dense looping interactions with a variety of stable external structures that stand in for the absent states of affairs. Language itself, I finally suggest, is the most potent and fundamental form of such surrogacy. Words are both cheap stand-ins for gross behavioral outcomes, and the concrete objects that structure new spaces for basic forms of learning and reason. A good hard look at surrogate situatedness thus turns the standard skeptical challenge on its head. But it raises important questions concerning what really matters about these new approaches, and it helps focus what I see as the major challenge for the future: how, in detail, to conceptualize the role of symbols (both internal and external) in dynamical cognitive processes.
The Methodology of Mesh-Cast Streaming in P2P Networks
Authors: Yi Ma, Ramazan S. Aygun
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Peer-to-Peer (P2P) streaming supports distributed data transfer over Internet. It claims high resource utilization and better streaming performance. In this paper, we define mesh-cast concept to model "manyto- many" streaming in P2P networks. The main origin of network congestion in mesh-cast is the articulation point/edge in inferred network topology. We resolve the congestion using the peripheral articulation node. We provide two possible approaches, optimistic and pessimistic, to solve network congestion in mesh-cast, both of which use a novel P2P structure, G-Super-Peer backbone.
A Trust Model for Ubiquitous Systems based on Vectors of Trust Values
Authors: Hassan Jameel, Le Xuan Hung, Umar Kalim, Ali Sajjad, Sungyoung Lee, Young-Koo Lee
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Ubiquitous Computing foresees a massively networked world supporting a population of diverse but cooperating mobile devices where trust relationships between entities are uncertain. Though there have been lots of effort focusing on trust for Ubiquitous Systems, they did not attach enough importance to uncertainty in their model. On the other hand, most of the works draw a general picture without a detailed computational model. In this paper, we present a trust model based on the vectors of trust values of different entities. The evaluation of trust depends upon the recommendation of peer entities common to the interacting entities. These recommendations are weighted according to the number and time of past interactions. Furthermore we present a method of handling false recommendations without introducing significant computational burden. The model can calculate trust between two entities in situations both in which there is past experience among the interacting entities and in which the two entities are communicating for the first time. Several tuning parameters are suggested which can be adjusted to meet the security requirement of a ubiquitous system.
A weight adaptation method for fuzzy cognitive map learning
Authors: I. Papageorgiou, P. Groumpos
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

Fuzzy cognitive maps (FCMs) constitute an attractive modeling approach that encompasses advantageous features. The most pronounces are the flexibility in system design, model and control, the comprehensive operation and the abstractive representation of complex systems. The main deficiencies of FCMs are the critical dependence on the initial expert&#x2019;s beliefs, the recalculation of the weights corresponding to each concept every time a new strategy is adopted and the potential convergence to undesired equilibrium states. In order to update the initial knowledge of human experts and to combine the human experts&#x2019; structural knowledge with the training from data, a learning methodology for FCMs is proposed. This learning method, based on nonlinear Hebbian-type learning algorithm, is used to adapt the cause&#x2013;effect relationships of the FCM model improving the efficiency and robustness of FCMs. A process control problem is presented and its process is investigated using the proposed weight adaptation technique.
Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
Authors: Hande Yaman
Venue: SIAM Journal on Discrete Mathematics (2005)

We consider the problem of installing a two-level telecommunication network. Terminal nodes communicate with each other through hubs. Hubs can be installed on terminal nodes and they are interconnected by a complete network. Each terminal is connected directly to a hub node. Integer amounts of capacity units are installed on the arcs between hub pairs and terminals and their hubs. The aim is to minimize the cost of installing hubs and capacity units on arcs. We present valid and facet defining inequalities for the polyhedron associated with this problem.
Handwritten Gesture Recognition Driven by the Spatial Context of Strokes
Authors: Francois Bouteruche, Eric Anquetil, Nicolas Ragot
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we present a new approach that explicitly exploits the spatial context of strokes to drive the shape recognition. We call this recognition method "context driven recognition" (CDR). The underlying idea is that only a sub-set of all possible symbols can be recognized in a specific spatial context. The main challenge is to detect and model automatically the context areas of interest so that the recognition method can be independent of any specific information on the targeted pen-based application. The paper details the learning scheme of the CDR method and how the obtained model is used during the recognition process. The results on a real-world pen-based recognition problem show that the method can reach better performances than a classical approach by decreasing the shape recognition complexity.
New Generation Wireless Technologies impact on Educational Environments Case: Utilizing Finnish Sign Language in Interpreter Training
Authors: Elisa Koskinen, Tiina Laaksonen, Ulla Veitonen, Ossi Vaananen
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

This paper describes the impact of wireless technology development and penetration in creating future educational and research environments. Learning community colleges with city organisations and companies are working out their own solutions without telecom operators. Extremely cost effective ways of networking have been found with new generation 4G-wireless infrastructure in Turku now having the largest public 4G-network in Finland and probably one of the largest in the world. The above mentioned success has necessitated revaluation of the current and planned learning environments, ways-ofworking and contents of research projects. The mobile sign language interpreting-research is used as a case-example. Interesting results have been gained in how sign language users could communicate in a mobile environment.
'Ere be dragons: an interactive artwork
Authors: Stephen Boyd Davis, Magnus Moar, John Cox, Chris Riddoch, Karl Cooke, Rachel Jacobs, Matt Watkins, Richard Hull, Tom Melamed
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The paper introduces a pervasive digital artwork which harnesses live heart-rate and GPS data to create a novel experience on a Pocket PC. The aims of the project, the technologies employed and the results of a preliminary trial are briefly described.
Leveraging Typing Phenomena to Design One-Handed Wearable Keyboards
Authors: Jill Coffin
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

Design practice in the HCI tradition often focuses on developing requirements from a task-based model of behavior. Touch typing is a complex task involving the translation of language into psychomotor rhythms acting on a spatial topology. An accurate model with appropriate emphases is difficult to construct; however, we may not need to construct the model if we can directly leverage the patterns of language and the innate tendencies of the human typist. This paper describes a design approach that leverages the phenomena of typing to inform the design of one-handed keyboards for wearable use. A reconfigurable keyboard is constructed and used in conjunction with a phrase set representative of the English language in a user study. The study resulted in various keyboard topologies and information about one-handed keyboarding relevant to design.
Symbolic time series analysis for anomaly detection: a comparative evaluation
Authors: Shin C. Chin, Asok Ray, Venkatesh Rajagopalan
Venue: Signal Processing (2005)

Recent literature has reported a novel method for anomaly detection in complex dynamical systems, which relies on symbolic time series analysis and is built upon the principles of automata theory and pattern recognition. This paper compares the performance of this symbolic-dynamics-based method with that of other existing pattern recognition techniques from the perspectives of early detection of small anomalies. Time series data of observed process variables on the fast time-scale of dynamical systems are analyzed at slow time-scale epochs of (possible) anomalies. The results are derived from experiments on a nonlinear electronic system with a slowly varying dissipation parameter.
Rascal: A Recommender Agent for Agile Reuse
Authors: Frank Mccarey, Mel Ó. Cinnéide, Nicholas Kushmerick
Venue: Artificial Intelligence Review (2005)

As software organisations mature, their repositories of reusable software components from previous projects will also grow considerably. Remaining conversant with all components in such a repository presents a significant challenge to developers. Indeed the retrieval of a particular component in this large search space may prove problematic. Further to this, the reuse of components developed in an Agile environment is likely to be hampered by the existence of little or no support materials. We propose to infer the need for a component and proactively recommend that component to the developer using a technique which is consistent with the principles of Agile methodologies. Our RASCAL recommender agent tracks usage histories of a group of developers to recommend to an individual developer components that are expected to be needed by that developer. Unlike many traditional recommender systems, we may recommend items that the developer has actually employed previously. We introduce a content-based filtering technique for ordering the set of recommended software components and present a comparative analysis of applying this technique to a number of collaborative filtering algorithms. We also investigate the relationship between the number of usage histories collected and recommendation accuracy. Our overall results indicate that RASCAL is a very promising tool for allowing developers discover reusable components at no additional cost
Integrating Hybrid Garbage Collection with Dual Priority Scheduling
Authors: Yang Chang, Andy Wellings
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

In this paper, we propose an approach to integrate a hybrid garbage collection algorithm (a combination of reference counting and mark-and-sweep techniques) into the current response time analysis framework for real-time systems. Instead of collecting garbage incrementally, we put most GC work into a periodic real-time thread, namely the GC thread, which is scheduled according to the dual priority scheduling method. More importantly, we can perform schedulability analysis (response time analysis) for all the real-time threads including the GC thread.
An Experimental Evaluation on Reliability Features of N-Version Programming
Authors: Xia Cai, Michael R. Lyu, Mladen A. Vouk
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Although N-version programming has been employed in some mission-critical applications, the reliability and fault correlation issues remain a debatable topic in the research community. In this paper, we perform a comprehensive evaluation on our recent project data on N-version programming and present statistical investigations on coincident failures and correlated faults. Furthermore, we compare our project with NASA 4-University project to identify the "variants" and "invariants" with respect to failure rate, fault density, coincident failures, related faults, and reliability improvement for N-version programming. Our experimental results support fault tolerance as an effective software reliability engineering technique.
A stochastic integral equation method for modeling the rough surface effect on interconnect capacitance
Authors: Zhenhai Zhu, J. White, A. Demir
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

In This work we describe a stochastic integral equation method for computing the mean value and the variance of capacitance of interconnects with random surface roughness. An ensemble average Green's function is combined with a matrix Neumann expansion to compute nominal capacitance and its variance. This method avoids the time-consuming Monte Carlo simulations and the discretization of rough surfaces. Numerical experiments show that the results of the new method agree very well with Monte Carlo simulation results.
Flow Map Layout
Authors: Doantam Phan, Ling Xiao, Ron Yeh, Pat Hanrahan, Terry Winograd
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded, or the number of packets in a network. The advantage of flow maps is that they reduce visual clutter by merging edges. Most flow maps are drawn by hand and there are few computer algorithms available. We present a method for generating flow maps using hierarchical clustering given a set of nodes, positions, and flow data between the nodes. Our techniques are inspired by graph layout algorithms that minimize edge crossings and distort node positions while maintaining their relative position to one another. We demonstrate our technique by producing flow maps for network traffic, census data, and trade data.
Modular program in basic: a solution to the barbershop problem
Authors: Harold Joseph Highland
Venue: ACM SIGSIM Simulation Digest (1976)

The 'Barbershop Problem' is primodial and ubiquitous in the teaching of modeling and simulation. It was only natural to present it to a class in "Conceptual Modeling, " which I taught about a year ago in the Computer Science Department of Hofstra University [Hempstead, Long Island, New York]. 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
The impact of ubiquitous computing in an undergraduate university honors community
Authors: Christian E. Wurst,  Jr.
Venue:  (2005)

Temple University issued laptop computers to entering freshmen in the Business Honors Program for the Fall 1999 semester. Existing students, (the sophomores, juniors and seniors) were not issued computers. This led to the creation of two cohorts of students who were very similar except for their inclusion in the laptop program. Those cohorts were the subjects of a three-year study to determine the impact of the ubiquitous computing program. The study utilized Campbell and Stanley's &ldquo;Institutional Wave&rdquo; design. Student satisfaction, student achievement (as measured by GPAs) and classroom constructivism were the measured outcomes. The GPAs were provided by the University, satisfaction and classroom constructivism were measured by instruments that were created for this study. There were mixed results. The Honors classrooms were more constructivist than the traditional classrooms but the level of constructivist activities did not increase as a result of the introduction of the laptop computers. Levels of student satisfaction and achievement were unaffected by the ubiquitous computing program.
Sequential Estimation of the Parameters of Regression Model
Authors: V. S. Stepashko, S. N. Efimenko
Venue: Cybernetics and Systems Analysis (2005)

Modified Gauss and Gram---Schmidt methods are proposed for recursive estimation of the parameters of sequentially complicated structures of regression models in observation-based simulation. Run times of these algorithms are compared with those of the recursive algorithm based on the well-known bordering method.
A Software Product Evaluation Process for Supporting the Component Based Development
Authors: Kilsup Lee, Sung Jong Lee
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Software quality evaluation based on ISO/IEC 9126 and ISO/IEC 14598 has been widely accepted in various areas. However, these standards for software quality do not provide practical guidelines to apply the quality model and the evaluation process of software products. And the quality management in most software projects has been conducted by managing defects without applying the standard quality model. Thus, we propose a Software Product Evaluation Process (SPEP) to support the Component Based Development (CBD). The SPEP adopts a tailored process from the standard evaluation process with applying weights of quality characteristics and checklists for the CBD artifacts. We also show a trial evaluation case through applying the SPEP to a small-scale software project. As a result, we believe that the SPEP will contribute to acquire high quality software.
Enterprise resource planning: a review and a STOPE view
Authors: Ali Haj Bakry Saad Haj Bakry
Venue: International Journal of Network Management (2005)

Enterprise resource planning (ERP) systems are becoming of increasing importance as integrated parts of business networks. They support 'e-business implementation' for better enterprise performance, 'integrate activities' for higher enterprise efficiency, and enjoy a 'modular architecture', for future extensions and further benefits. The aim of this review is to introduce ERP systems and explore their current state and future potentials. Using recent literature, the review provides a comprehensive understanding of ERP systems, including illustrating their main components and clarifying their basic and extended features. In addition, the review highlights the main producers of ERP systems, together with their partners and customers. Based on previous investigations, the review also addresses ERP selection criteria and critical implementation factors. Finally, recent views of ERP systems and their future development, including their enhanced intelligence, expansion, and management, are given. The views also include a STOPE view (strategy, technology, organization-enterprise, people, environment), which illustrates the integration of ERP systems with the overall enterprise network.