ppxscal/embedding_network huggingface dataset:
Get smart
Authors: Alex Wright
Venue: Communications of the ACM (2009)

Future generations of smartphones will be context aware, tracking your behavior, providing information about the immediate environment, and anticipating your intentions.
Linked Stack Buffer Management for Shared-Stacks
Authors: Boncheol Gu, Junyoung Heo, Yookun Cho, Younghwan Kim
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

Severe memory constraint of wireless sensor networks (WSN) causes lots of problems such as irrecoverable stack overflow and out-of-memory failure. These problems motivated to develop efficient memory management schemes for WSNs. A shared-stack is the memory-efficient thread stack, designed for memory-constrained environments such as WSNs. However, stack switching of shared-stacks makes external memory fragmentation, which induces memory space overhead, or CPU overhead to eliminate it. In this paper, we propose a novel stack buffer management scheme for shared-stacks, called linked stack buffer management. It manages context of threads as multiple linked stack buffers. The simulation results demonstrate that the proposed scheme alleviates external fragmentation of shared-stacks efficiently.
Specifying and Analysing SOC Applications with COWS
Authors: Alessandro Lapadula, Rosario Pugliese, Francesco Tiezzi
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

COWS is a recently defined process calculus for specifying and combining service-oriented applications, while modelling their dynamic behaviour. Since its introduction, a number of methods and tools have been devised to analyse COWS specifications, like e.g. a type system to check confidentiality properties, a logic and a model checker to express and check functional properties of services. In this paper, by means of a case study in the area of automotive systems, we demonstrate that COWS, with some mild linguistic additions, can model all the phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, orchestration, deployment, reconfiguration and execution. We also provide a flavour of the properties that can be analysed by using the tools mentioned above.
Image Cluster Compression Using Partitioned Iterated Function Systems and Efficient Inter-image Similarity Features
Authors: Matthias Kramm
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

When dealing with large scale image archive systems, efficient data compression is crucial for the economic storage of data. Currently, most image compression algorithms only work on a per-picture basis --- however most image databases (both private and commercial) contain high redundancies between images, especially when a lot of images of the same objects, persons, locations, or made with the same camera, exist. In order to exploit those correlations, it's desirable to apply image compression not only to individual images, but also to groups of images, in order to gain better compression ratesby exploiting inter-image redundancies.This paper proposes to employ a multi-image fractal Partitioned Iterated Function System (PIFS) for compressing image groups and exploiting correlations between images. In order to partition an image database into optimal groups to be compressed with this algorithm, a number of metrics are derived based on the normalized compression distance (NCD) of the PIFS algorithm. We compare a number of relational and hierarchical clustering algorithms based on the said metric.In particular, we show how a reasonable good approximation of optimal image clusters can be obtained by an approximation of the NCD and nCut clustering. While the results in this paper are primarily derived from PIFS, they can also be leveraged against other compression algorithms for image groups.
Summary of AIEE-IRE-ACM conference
Authors: Allen V. Astin
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

To attempt to summarize the disclosures of this important three-day conference on information-processing systems is for me a most difficult assignment. Each paper was in itself a summary of extensive investigations, usually covering the co-operative efforts of large teams of engineers and scientists. Furthermore, I was unable personally to hear more than a few of the papers although I was fortunate in having advance copies of most of the others. For the remaining coverage I am indebted for effective reports to the good efforts of Miss Mary Stevens and Sam Alexander of the NBS staff. I am further indebted to these two for the opportunity of discussing highlights of many of the conference papers. 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
KANTS: Artifical Ant System for Classification
Authors: Carlos Fernandes, Antonio Miguel Mora, Juan Julián Merelo, Vitorino Ramos, Juan Luís Laredo, Agostihno Rosa
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

This paper investigates a new model that takes advantage of the cooperative self-organization of Ant Algorithms to evolve a naturally inspired pattern recognition (and also clustering) method. The approach considers each data item as an ant that changes the environment as it moves through it. The algorithm is successfully applied to well-known classification problems and yields better results than some other classification approaches, like K-Nearest Neighbours and Neural Networks.
The ADSP-2100 DSP Microprocessor
Authors: John Roesgen
Venue: IEEE Micro (1986)

The 2100 accesses external memory efficiently and devotes its silicon area to providing greater functionality and processing throughput. 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
Four step in phase predictor corrector method for periodic initial value problems
Authors: Pragya Jain
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

In this paper, 4-step in phase and with minimal phase-lag predictor-corrector methods are developed for the numerical integration of periodic initial value problems using the implicit method of Raptis-Simos [23]. The 4-step in phase P-C method is of order six and it possesses an interval of periodicity of size 3.3874. We also obtain a 4-step sixth-order P-C method with minimal phase-lag of order eight. The numerical results for ordinary and partial differential initial value problems show that the 4-step predictor-corrector in phase method gives accurate results comparable to those of the implicit in phase method of Raptis-Simos [23].
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
Authors: Yossi Azar, Uriel Feige, Daniel Glasner
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fashion, where every request is a path in the tree. The online algorithm may accept a request only if it does not share a vertex with a previously accepted request. The goal is to maximize the number of accepted requests. It is known that no online algorithm can have a competitive ratio better than ¿(logn) for this problem, even if the algorithm is randomized and the tree is simply a line. Obviously, it is desirable to beat the logarithmic lower bound. Adler and Azar [SODA 1999] showed that if preemption is allowed (namely, previously accepted requests may be discarded, but once a request is discarded it can no longer be accepted), then there is a randomized online algorithm that achieves constant competitive ratio on the line. In the current work we present a randomized online algorithm with preemption that has constant competitive ratio on any tree. Our results carry over to the related problem of maximizing the number of accepted paths subject to a capacity constraint on vertices (in the disjoint path problem this capacity is 1). Moreover, if the available capacity is at least 4, randomization is not needed and our online algorithm becomes deterministic.
Verification of Supervisory Control Software Using State Proximity and Merging
Authors: Flavio Lerda, James Kapinski, Edmund M. Clarke, Bruce H. Krogh
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

This paper describes an approach for bounded-time verification of safety properties of supervisory control software interacting with a continuous-time plant. A combination of software Model Checking and numerical simulation is used to compute a conservative approximation of the reachable states. The technique verifies system properties in the presence of nondeterministic behavior in the software due to, for instance, interleaving of tasks. A notion of program equivalence is used to characterize the behaviors of the controller, and the bisimulation functions of Girard and Pappas are employed to characterize the behaviors of the plant. The approach can conservatively merge traces that reach states that are in proximity to each other. The technique has been implemented for the case of affine plant dynamics, which allows efficient operations on ellipsoidal sets based on convex optimization involving linear matrix inequalities (LMIs). We present an illustrative example for a model of the position controller of an unmanned aerial vehicle (UAV).
A Fast New Small Target Detection Algorithm Based on Regularizing Partial Differential Equation in IR Clutter
Authors: Biyin Zhang, Tianxu Zhang, Kun Zhang
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

To detect and track moving dim targets against the complex cluttered background in infrared (IR) image sequences is still a difficult issue because the nonstationary structured background clutter usually results in low target detectability and high probability of false alarm. A brand-new adaptive Regularizing Anisotropic Filter based on Partial Differential Equation (RAFPDE) is proposed to detect and track a small target in such strong cluttered background. A regularization operator is employed to adaptively eliminate structured background and simultaneously enhance target signal. The proposed algorithm's performance is illustrated and compared with a two-dimensional least mean square adaptive filter algorithm and a BP neural network prediction algorithm on real IR image data. Experimental results demonstrate that the proposed novel method is fast and effective.
The Scyther Tool: Verification, Falsification, and Analysis of Security Protocols
Authors: Cas J. Cremers
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

With the rise of the Internet and other open networks, a large number of security protocols have been developed and deployed in order to provide secure communication. The analysis of such security protocols has turned out to be extremely difficult for humans, as witnessed by the fact that many protocols were found to be flawed after deployment. This has driven the research in formal analysis of security protocols. Unfortunately, there are no effective approaches yet for constructing correct and efficient protocols, and work on concise formal logics that might allow one to easily prove that a protocol is correct in a formal model, is still ongoing. The most effective approach so far has been automated falsification or verification of such protocols with state-of-the-art tools such as ProVerif [1] or the Avispa tools [2]. These tools have shown to be effective at finding attacks on protocols (Avispa) or establishing correctness of protocols (ProVerif).
A Framework for Simulation Models of Service-Oriented Architectures
Authors: Falko Bause, Peter Buchholz, Jan Kriege, Sebastian Vastag
Venue: Proceedings of the SPEC international workshop on Performance Evaluation: Metrics, Models and Benchmarks (2008)

Service-Oriented Architectures (SOA) are one of the main paradigms for future software systems. Since these software systems are composed of a large number of different components it is non trivial to assure an adequate Quality of Service (QoS) of the overall system and performance analysis becomes an important issue. To consider performance issues early in the development process, a model based approach becomes necessary which has to be embedded into the development process of SOA to avoid overhead and assure consistency. In particular the specification of the software system should be used as a base for the resulting performance model. However, since common specification techniques for SOA are very high level, many details have to be added to come to an executable simulation model which is often needed for a detailed analysis of performance or dependability. This paper presents an approach which combines an extended version of process chains to describe the SOA components and some quantitative specifications at the higher levels. For the modelling of the detailed architecture and protocols the simulation tool OMNeT++ is used. Both modelling levels are combined resulting in an executable simulation model for the whole architecture.
Mobility Management for VoIP on Heterogeneous Networks: Evaluation of Adaptive Schemes
Authors: Massimo Bernaschi, Filippo Cacace, Giulio Iannello, Massimo Vellucci
Venue: IEEE Transactions on Mobile Computing (2007)

The introduction of the IP multimedia subsystem on 3G cellular networks and the integration with other widely deployed wireless networks based on the IEEE 802.11 protocol family require support for both mobility and quality of service. When mobile systems move across heterogeneous networks, ongoing real-time sessions are affected not only by handoff delay but also by different packet delay and bit-rate. In this paper we propose a cross-layer mechanism that takes into account mobility at different layers of the network stack in order to yield better quality for VoIP, videoconferencing and other real-time applications.We describe our cross-layer architecture, adaptation techniques, a prototype implementation and experimental results.
Ultrasound Quantitative Evaluation of Human Eye Cataract
Authors: Alvydas Paunksnis, Skaidra Kurapkienė, Audris Mačiulis, Audris Kopustinskas, Marija Paunksnienė
Venue: Informatica (2007)

A technique to improve an eye cataract early detection and quantitative evaluation of maturity using ultrasound was investigated. A broadband coherent signal, backscattered from an eye lens tissue, was digitized, recorded and processed. A new parameter - lens quality was proposed for the human eye cataract quantitative evaluation. Lens quality reflects two phenomena of ultrasound interaction with lens tissue - attenuation and scattering. Digital technique for echo-signal energy and time frequency analysis was applied, ultrasound waves scattering strength and spectral slope was calculated. Experimental statistical investigations performed with signals divided into five groups - mature cataract, immature form of cataract, incipience cataract phase, healthy lenses and human eye phantom. Investigations have showed that value of specific quality in the test groups vary in the wide range from 1 to 60. This feature allows theoretically differentiate eye lenses cataract in different classes with defined boundaries. Presented results show that we with high reliability can differentiate lenses into three groups: healthy lenses (Q L>50), lenses with incipient or immature cataract (Q L=2-20) and lenses with mature cataract (Q L<1). The investigated method can be used for an eye lens classification and for early cataract detection This technique was used at the Department of Ophthalmology, Institute for Biomedical Research, Kaunas University of Medicine.
Identifying factors that predict student success in a community college online distance learning course
Authors: Jeffrey M. Allen
Venue:  (2007)

The study's purpose was to identify demographics, educational background, finances, formal and informal education and experiences, reading habits, external environmental factors, psychological factors, and computer efficacy factors that predict a student's ability to successfully complete an online (Web-based) distance learning community college course. Major student retention theories and student attrition and persistence research guided the study. Distance learners ( N = 926) completed four surveys, which collected data for 26 predictor variables that included age, gender, marital status, ethnicity, support others, course load, first-time student, last semester attended, student type and location, financial stability, tuition payment, prior learning experiences, reading habits, family support, enrollment encouragement, study encouragement, time management, study environment, employment, extrinsic and intrinsic motivation, locus of control, self-efficacy, computer confidence and skills, and number of prior online courses. Successful or unsuccessful course completion was the dependent variable. Statistical analyses included Cronbach's alpha, Pearson chi-square, two-sample t test, Pearson correlation, phi coefficient, and binary logistic regression. Variables in each factor were entered sequentially in a block using separate binary logistic regression models. Statistically significant variables were course load, financial stability, prior learning experiences, time management and study environment, extrinsic motivation, self-efficacy, and computer skills. Selected predictor variables (N = 20) were entered hierarchically in a logistic regression model of which course load, financial stability, and self-efficacy were statistically significant in the final block. Correlation coefficients were computed for statistically significant predictor variables to determine whether the significance was confined to the control group or an overall level of significance. Findings were supported through cross-validation and forward stepwise entry of variables in logistic regression.Despite having two or more at-risk factors, distance learners who had high levels of self-efficacy, good computer and time management skills, financial stability, a favorable study environment, were enrolled in more than one course, and believed their prior learning experiences helped prepared them for their course were more likely to be successful.
Singularity Analysis of a 3DOF Parallel Manipulator Using Infinite Constraint Plane Method
Authors: Hodjat Pendar, Hajir Roozbehani, Hoda Sadeghian, Hassan Zohoor
Venue: Journal of Intelligent and Robotic Systems (2008)

In this article a novel geometrical method is presented to obtain singular points of a parallel manipulator. First, the constrained plain method (CPM) and some of its application in parallel mechanism is introduced. Given the definition of constraint plane (CP) and infinite constraint plane (ICP) the dependency conditions of constraints is achieved with the use of a new theorem based on the Ceva geometrical theorem. Another theorem is used to achieve the direction of angular velocity of a body having three ICPs. Finally, as an example, using these two theorems, singularities of the 3UPS_PU mechanism are obtained. This method is completely geometrical, involving no complex or massive calculations and yields the answer quickly. In the previous methods based on the Grassmann geometry, the mechanism needs to be statically analyzed at first, so that the Inverse Jacobian matrix is achieved, and then the Plucker-vector is derived. It usually needs exhaustive search of the workspace using an accurate analytical model of the mechanism kinematics and may lead to plenty of conditions remained to be pondered in order to obtain the singularity conditions.
Research on mobile manipulator tip-over stability and compensation
Authors: Yu-Hong Liu, Xian-Chun Meng, Ming-Lu Zhang
Venue: Proceedings of the 8th WSEAS International Conference on Robotics, Control and Manufacturing Technology (2008)

This paper analyses the reasons for resulting in the instability of mobile manipulator. Several methods of stability analysis and errors compensation are introduced, including the theories, the modeling processes and their characteristics. The significance of analysing the stability and compensating the errors are expounded. In addition, the corresponding applications are also discussed. Finally, the future study direction of mobile manipulator stability analysis and compensation is prospected.
Haptic two-finger contact with textiles
Authors: Guido B&#x00f6;ttcher, Dennis Allerkamp, Daniel Gl&#x00f6;ckner, Franz-Erich Wolter
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Real-time cloth simulation involves many computational challenges to be solved, particularly in the context of haptic applications, where high frame rates are necessary for obtaining a satisfying experience. In this paper, we present an interactive cloth simulation system that offers a compromise between a realistic physics-based simulation of fabrics and a haptic application meeting high requirements in terms of computation speed. Our system allows the user to interact with the fabric using two fingers. The required performance of the system is achieved by introducing an intermediate layer responsible for the simulation of the small part of the surface being in contact with the fingers. Additionally we separate the possible contact situations into different cases, each being individually handled by a specialised contact algorithm.
Dynamic Requirements Specification for Adaptable and Open Service-Oriented Systems
Authors: Ivan J. Jureta, Stéphane Faulkner, Philippe Thiran
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

It is not feasible to engineer requirements for adaptable and open service-oriented systems (AOSS) by specifying stakeholders' expectations in detail during system development. Openness and adaptability allow new services to appear at runtime so that ways in, and degrees to which the initial functional and nonfunctional requirements will be satisfied may vary at runtime. To remain relevant after deployment, the initial requirements specification ought to be continually updated to reflect such variation. Depending on the frequency of updates, this paper separates the requirements engineering (RE) of AOSS onto the RE for: individual services (Service RE), service coordination mechanisms (Coordination RE), and quality parameters and constraints guiding service composition (Client RE). To assist existing RE methodologies in dealing with Client RE, the Dynamic Requirements Adaptation Method (DRAM) is proposed. DRAM updates a requirements specification at runtime to reflect change due to adaptability and openness.