ppxscal/embedding_network huggingface dataset:
TwiddleNet: Smartphones as Personal Content Servers for First Responders
Authors: Gurminder Singh, Dirk Ableiter
Venue: Mobile Response: Second International Workshop on Mobile Information Technology for Emergency Response, MobileResponse 2008. Bonn, Germany, May 29-30, 2008, Revised Selected Papers (2009)

TwiddleNet uses smartphones as personal servers to enable instant content capture and dissemination for first-responders. It supports the information sharing needs of first responders in the early stages of an emergency response operation. In TwiddleNet, content, once captured, is automatically tagged and disseminated using one of the several networking channels available in smartphones. TwiddleNet pays special attention to minimizing the equipment, network set-up time, and content capture and dissemination effort. It can support small teams of emergency responders in the first 48-72 hours of an emergency response by using smartphone-based infrastructure and scale up to handle a much larger number of users with a more robust backend.
An Evaluation of Graphical Context as a Means for Ameliorating the Effects of Registration Error
Authors: Cindy M. Robertson, Blair MacIntyre
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

An ongoing research problem in Augmented Reality (AR) is to improve tracking and display technology in order to minimize registration errors. However, perfect registration is not always necessary for users to understand the intent of an augmentation. This paper describes the results of an experiment to evaluate the effects of registration error in a Lego block placement task and the effectiveness of graphical context at ameliorating these effects. Three types of registration error were compared: no error, fixed error and random error. These three errors were evaluated with no context present and some graphical context present. The results of this experiment indicated that adding graphical context to a scene in which some registration error is present can allow a person to effectively operate in such an environment, in this case completing the Lego block placement task with a reduced number of errors made and in a shorter amount of time.
Concept for a novel grain level measurement method in silos
Authors: Hakan İşiker, Hüseyin Canbolat
Venue: Computers and Electronics in Agriculture (2009)

The grain level in a silo is commercially important. In this work, a novel method is presented to detect the grain level in a silo. Existing methods are generally based on approximations, due to grain dust in the silo. The method proposed here eliminates the effect of grain dust and gives the accurate reading of the grain level. The method is based on the measurements of capacitances of parallel plate capacitive structures, which are designated as level, reference and dust sensors. It is mathematically proved that the method eliminates different factors, which affect the readings. The result of a computer simulation, which demonstrates the performance and limitations of the proposed structure, is also provided. The level is read exactly inside the reference sensor. However, comparing with the total amount of grain in the silo, there is an error of around 7 percent. The amount of this error is dependent on silo parameters and the flatness of the grain accumulation. Indeed, this error is intrinsic to any silo level measuring system due to non-flat grain accumulation.
Fast Custom Instruction Identification Algorithm Based on Basic Convex Pattern Model for Supporting ASIP Automated Design
Authors: Kang Zhao, Jinian Bian, Sheqin Dong, Yang Song, Satoshi Goto
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

To improve the computation efficiency of the application specific instruction-set processor (ASIP), a strategy of hardware/software collaborative design is usually utilized. In this process, the auto-customization of specific instruction set has always been a key part to support the automated design of ASIP. The key issue of this problem is how to effectively reduce the huge exponential exploration space in the instruction identification process. To address this issue, we first formulate it as a feasible sub-graph enumeration problem under multiple constraints, and then propose a fast instruction identification algorithm based on a new model called basic convex pattern (BCP). The kernel technique in this algorithm is the transformation from the graph exploration to the formula-based computations. The experimental results have indicated that the proposed algorithm has a distinct reduction in the execution time.
Large-scale wire-speed packet classification on FPGAs
Authors: Weirong Jiang, Viktor K. Prasanna
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Multi-field packet classification is a key enabling function of a variety of network applications, such as firewall processing, Quality of Service differentiation, traffic billing, and other value added services. Although a plethora of research has been done in this area, wire-speed packet classification while supporting large rule sets remains difficult. This paper exploits the features provided by current FPGAs and proposes a decision-tree-based, two-dimensional dual-pipeline architecture for multi-field packet classification. To fit the current largest rule set in the on-chip memory of the FPGA device, we propose several optimization techniques for the state-of-the-art decision-tree-based algorithm, so that the memory requirement is almost linear with the number of rules. Specialized logic is developed to support varying number of branches at each decision tree node. A tree-to-pipeline mapping scheme is carefully designed to maximize the memory utilization. Since our architecture is linear and memory-based, on-the-fly update without disturbing the ongoing operations is feasible. The implementation results show that our architecture can store 10K real-life rules in on-chip memory of a single Xilinx Virtex-5 FPGA, and sustain 80 Gbps (i.e. 2x OC-768 rate) throughput for minimum size (40 bytes) packets. To the best of our knowledge, this work is the first FPGA-based packet classification engine that achieves wire-speed throughput while supporting 10K unique rules.
On the guessing number of shift graphs
Authors: Taoyang Wu, Peter Cameron, Søren Riis
Venue: Journal of Discrete Algorithms (2009)

In this paper we investigate guessing number, a relatively new concept linked to network coding and certain long standing open questions in circuit complexity. Here we study the bounds and a variety of properties concerning this parameter. As an application, we obtain the lower and upper bounds for shift graphs, a subclass of directed circulant graphs.
On the application of epidemical spreading in collaborative context-aware computing
Authors: Christos Anagnostopoulos, Stathes Hadjiefthymiades
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2009)

Pervasive Computing Research Group, Department of Informatics and Telecommunications, University of Athens, Panepistimiopolis, Ilissia, 15784, Athens, Greece. We investigate the very important concept of collaborative context awareness. Applications operating in nodes with spatial proximity and network connectivity exchange the contextual information (context) captured by their sensors (or other similar data sources). Such scheme improves the characteristics of the context aware application (e.g., robustness). The exchange of context in our model is progressed beyond a simple flooding scheme. We adopt an epidemic model, which relays information in a stochastic manner. In our model, nodes have a reasoning capability, which can further process and transform the incoming context. The derived context can be relayed throughout the network. This multi-epidemic model relies on semantic dependencies, which are modeled through a hierarchical representation scheme. We investigate the efficiency of the proposed architecture in light of different spreading parameters. Our simulations take into account the temporal validity of the exchanged context (i.e., relayed information remains valid for a certain period of time), the status of the sensing elements and the mobility of nodes. Our findings are quite promising for the emerging area of context aware application engineering.
Category-Based Inductive Reasoning: Rough Set Theoretic Approach
Authors: Marcin Wolski
Venue: Transactions on Rough Sets IX (2008)

The present paper is concerned with rough set theory (RST) and a particular approach to human-like induction, namely similarity coverage model (SCM). It redefines basic concepts of RST --- such like e.g. a decision rule, accuracy and coverage of decision rules --- in the light of SCM and explains how RST may be viewed as a similarity-based model of human-like inductive reasoning. Furthermore, following the knowledge-based theory of induction, we enrich RST by the concept of an ontology and, in consequence, we present an RST-driven conceptualisation of SCM. The paper also discusses a topological representation of information systems in terms of non-Archimedean structures. It allows us to present an ontology-driven interpretation of finite non-Archimedean nearness spaces and, to some extent, to complete recent papers about RST and the topological concepts of nearness.
Computation reuse in domain-specific optimization of signal recognition
Authors: Melina Demertzi, Pedro C. Diniz, Mary W. Hall, Anna C. Gilbert, Yi Wang
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Domain-specific optimizations that exploit specific arithmetic and representation formats have been shown to achieve significant performance/area gains in FPGA hardware designs. In this work, we describe an approach to domain-specific optimization that goes beyond this representation level. We perform a joint optimization from a high-level mathematical abstract representation and hardware implementation point of view. We focus on a signal recognition system that distinguishes between spoken digits. We construct transform matrices from Walsh wavelet packets in conjunction with a BestBasis algorithm. The resulting transform matrices exhibit a rich algebraic structure and contain significant overlap across rows, exhibiting significant computation reuse in the dot-product operation of the transform matrix applied to the signal vector. We have developed an algorithm for identifying the computation reuse and scheduling the row computations across various computation units to significantly reduce the overall amount of computation. We have implemented a custom-built dot-product multiplication unit targeting a Virtex-II-Pro FPGA device that exploits computation reuse. A baseline dot-product multiplication unit, without reuse, exhibits a maximum clock rate of 199.3 MHz while utilizing only 2% of the device capacity. The optimized system that exploits reuse also includes a computation scheduler and attains a respectable clock rate of 196 MHz while using 8,183 (57%) slices of the FPGA device. The FPGA hardware implementation reduces the amount of computation for an individual matrix by as much as 6.35× and an average of 2× for a single pipelined dot-product unit over the baseline implementation. Although it is larger in area than the baseline, the implementation that exploits reuse even achieves a 2× computation reduction when compared to 3 concurrently-executing simpler accumulation units with the same aggregate FPGA design area. While the results in this paper reflect the opportunities of a specific signal processing problem, this work highlights the concept of exploiting computation reuse derived from a higher-level abstract representation at a mathematical and hardware level. As such, we believe this approach can also be leveraged in other signal recognition problems with specific well-characterized computational structures and signal dictionaries.
Exchange facilities CATIA-ENOVIA using macros
Authors: C. Ispas, M. Zapciu, A. Mitrache
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

Computer Aided Three dimensional Interactive Application (CATIA) is a multiplatform CAD/CAM/CAE commercial software suite developed by French company Dassault Systemes and marketed world-wide by IBM. CATIA is widely used throughout the engineering industry, especially in the automotive and aerospace domains. In this work-paper will be presented some programs, realized with the help of "Macros" of Catia V5, which helps "cleaning" the pieces inside a migrate ensemble from Catia V4 to Catia V5 and arranging the tree for it can be visualized and imported in Enovia VPM. These macros programs were developed being necessary in the practical cases, when CAD applications use in a collaborative way the software Catia V5 and Enovia VPM.
Viewpoint of ISO GMITS and probabilistic risk assessment in information security
Authors: Naoki Satoh, Hiromitsu Kumamoto, Yasunobu Kino, Norihisa Komoda
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Among the previous studies on the quantification of information security risks, one of the most popular tools is ISO GMITS, which quantifies the risk of information asset on the whole based on the scores of information asset, threat, and vulnerability. However, in our previous study, we maintained that "probabilistic risk assessment" (hereafter abbreviated as PRA), which has been traditionally employed in assessing the risk of physical systems such as a nuclear reactor and a chemical plant, is superior to GMITS in the ability of generating the scenario of hazard occurrence, and so on. In this paper, by taking Firewall (F/W) and Entrance control as an example, we will clarify the advantages of PRA over GMITS in generating more detailed scenario, in the ability of risk quantification, and so on.
A Practical and Light Integrated WebGIS Based On SVG
Authors: Yuan Man, Chen Xiuhong, Yang Chunling, Niu Jianwei
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

With the development of GIS, all kinds of GIS systems are applied to different domains, such as location, oil exploration, traffic and so on. The traditional GIS only provides basic GIS functions, whereas, in practice, the users wish to integrate their applications into GIS. If traditional GIS is employed for integrating applications, it must employ the APIs to develop application-based-on-GIS. In spite of this it is difficult to integrate applications into GIS seamlessly .Therefore, a novel light and practical integrated WebGIS framework is proposed. Firstly, it gives the organization form of all kinds of space GIS objects; secondly, through SVG various space GIS objects are mapped into SVG DOM document; thirdly, by means of SVG, map layers' management is implemented; fourthly, a kind of efficient decentralized GIS objects loading algorithm is proposed; fifthly, many meta-models which are used to describe all kinds of resources constructed by meta-data; finally, a kind of running frame for WebGIS is given. It is well known that oil and gas is nation vitals, and oil field accumulates amount of business data. How to integrate these different specialties' data into WebGIS puzzled oil field users. The WebGIS framework which integrated kinds of specialties' applications has been applied to Daqing oil fields, different users can expediently query their own interested information by GIS navigation. The practical application shows that integrated WebGIS framework is not only applicable for users, but also high efficiency for map operation. The light WebGIS framework and its novel idea also can be applied to other domains.
Mobile technology for crime scene examination
Authors: Chris Baber, Paul Smith, Mark Butler, James Cross, John Hunter
Venue: International Journal of Human-Computer Studies (2009)

In this paper, the concept of distributed cognition is used to inform the design, development and trialling of technologies to support Crime Scene Examination is reported. A user trial, with trainee Crime Scene Examiners, was conducted to compare the ways in which evidence search and recovery could be combined with the production of a crime scene report (that must be written at the scene). Participants completed the crime scene report using either the conventional paper form, an electronic form on a tablet computer (to represent the current trend in digitisation of crime scene reports), or a wearable computer (with speech input). While both computer conditions (tablet and wearable) led to faster performance, when compared with the paper condition, there was no difference in content or quality of the reports produced in any of the three conditions; thus, the computer conditions produced acceptable reports in much faster time when compared to conventional practice. Furthermore, activity sampling analysis showed that participants found it much easier to integrate the wearable computer (than either paper forms or tablet computer) into their search and recovery activity.
Brief paper: L2 gain analysis for a class of switched systems
Authors: Liang Lu, Zongli Lin, Haijun Fang
Venue: Automatica (Journal of IFAC) (2009)

This paper considers the problem of disturbance tolerance/rejection for a family of linear systems subject to actuator saturation and L"2 disturbances. For a given set of linear feedback gains, a given switching scheme and a given bound on the L"2 norm of the disturbances, conditions are established in terms of linear or bilinear matrix inequalities under which the resulting switched system is bounded state stable, that is, trajectories starting from a bounded set will remain inside the set or a larger bounded set. With these conditions, both the problem of assessing the disturbance tolerance/rejection capability of the closed-loop system and the design of feedback gain and switching scheme can be formulated and solved as constrained optimization problems. Disturbance tolerance is measured by the largest bound on the disturbances for which the trajectories from a given set remain bounded. Disturbance rejection is measured by the restricted L"2 gain over the set of tolerable disturbances. In the event that all systems in the family are identical, the switched system reduces to a single system under a switching feedback law. It will be shown that such a single system under a switching feedback law has stronger disturbance tolerance/rejection capability than a single linear feedback law can achieve.
Feedback-assisted robust estimation of available bandwidth
Authors: Kyung-Joon Park, Hyuk Lim, Jennifer C. Hou, Chong-Ho Choi
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

The packet pair technique is a widely used method for estimating the available bandwidth of an end-to-end network path. We characterize the stochastic nature of the packet pair dispersion caused by bursty cross traffic and its adverse effect on available bandwidth estimation. In order to overcome this difficulty, we introduce a novel concept of the relative distance, which can be obtained from the relation between input and output gaps of packet pairs. By exploiting the quasi-invariant characteristic of the relative distance, we develop a feedback-assisted, robust and non-intrusive approach for estimating the available bandwidth. The method entitled bTrack periodically sends two pairs of probe packets of different sizes and exploits the relative distance for accurate estimation of the available bandwidth. The amount of the probing traffic is independent of the available bandwidth and is adjustable by tuning of the probing period, which shows the non-intrusive nature of bTrack. We give the convergence analysis of bTrack based on the theory of the stochastic approximation, which guarantees the robust performance of bTrack under bursty cross traffic. We verify via extensive ns-2 simulations and empirical experiments (over campus intranets and the Internet) that bTrack tracks the available bandwidth very well and is not intrusive.
A method for numerical solution of a multidimensional convection-diffusion problem
Authors: V. A. Prusov, A. E. Doroshenko, R. I. Chernysh
Venue: Cybernetics and Systems Analysis (2009)

We propose a modification of the additive splitting algorithm to solve the convection-diffusion problem using an efficient finite-difference scheme. The modification decreases the number of data exchanges and their amount during the numerical solution of a system of multidimensional equations. Approximation, stability, and convergence are considered.
Complex sensorial systems used for the planning of some intelligent vehicles needed for the transport of the persons with handicaps
Authors: Valeriu Lupu, Catalin Lupu, Nicolae Morariu
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

This article presents complex sensorial systems used for the planning of some intelligent vehicles that have the mission to transport persons with handicaps inside of a building (or in a room). The cars work in a varied land, with walls, chairs, domestic appliances, lockers, and other obstacles that it might meet in its way (this obstacles are present from the beginning in the studied land or they can appear in every moment) and whom it might avoid. The cars can leave all at one moment or individually. They can meet on their way, but they must avoid the collisions by communicating between them through the server. The machines are equipped with complex sensorial systems like video cameras, transducers, proximity sensors, neuro-fuzzy logic. Sequential rapid algorithms - like Strassen's and Winograd's - are used for the matrices multiplication (by using parallel calculus) and Dijkstra's algorithm for the calculus of the optimum road between two points by using parallel programming.
Modular documentation: a software development tool
Authors: Roy E. Anderson
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

This paper presents a scheme for documenting the design and implementation of a large software system. The scheme is presented in terms of a family of documents based on the decomposition of any system into specific levels of abstraction for the purpose of software development. It facilitates the use of structured design techniques, provides tangible objects for organizing manpower resources on the basis of the system's structure, gives management meaningful milestones with which to measure development progress, and results in a fully documented system when the implementation phase is complete.
Physical manipulation: evaluating the potential for tangible designs
Authors: Andrew Manches, Claire O'Malley, Steve Benford
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

In order to design tangible technologies that are effective in supporting children's learning, it is important to understand what advantages or limitations are afforded by physical manipulation. This paper highlights some of the perceptual and manipulative properties of physical representations with respect to their effect on the problem space and describes how, for certain problem types, these may benefit children's strategies and learning. These arguments are discussed in relation to ongoing research into children's use of physical materials to solve numerical problems, and comparative performance using virtual materials. The paper uses this research to suggest ways in which tangible designs may support learning in this area by building on the advantages of physical manipulation whilst avoiding limiting exploration by constraining the range of actions and possible learning opportunities provided.