ppxscal/embedding_network huggingface dataset:
A Neural Network Approach on Analyzing and Reducing Signalized Intersection Crashes
Authors: Pei Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In this study, a back propagation artificial neural network model utilizing characteristics of urban signalized intersections for occurrence prediction of intersection -- related traffic crashes, along with its application for crash reduction, are proposed. The 1,593 traffic crashes reported at 62 signalized intersections in Taichung city, Taiwan during year 2000-2001 were analyzed. These intersections were decomposed into 636 approaching direction combinations (ADCs). Characteristics, as well as the number of crashes, corresponding to each ADC were investigated. A back propagation artificial neural network (ANN) model was then generated. It was found that the ANN model exhibited great prediction ability with 0.992 correlation coefficient, and 3.38E- 06 mean square error. With the ANN model, a proposed decision-making scheme for intersection rehabilitation was suggested. Case study indicated that the suggested scheme could serve well as a referable tool.
TLDFS: A Distributed File System based on the Layered Structure
Authors: Lei Wang, Chen Yang
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

This paper presents a novel distributed file system TLDFS, which consists of two layers. One is the block device layer, which makes the distributed file system manage the consistency of data easily by choosing an appropriate granularity of lock. We implement the distributed interfaces and the new data organization at the block level, which is different from most distributed file systems. The other is the file system layer that consists of three parts: interconnecting module, locking module and distributed file system module. Our prototype system proves the feasibility of the two-layered structure and the experiments show several advantages of TLDFS.
Adapting to Application Workflow in Processing Data Integration Queries
Authors: Yongwei WU, Jia LIU, Gang Chen, Guangwen Yang, Bo Cao, Weimin Zheng
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Data integration has evolved to provide efficient data management across distributed and heterogeneous data sources in grid environment. However, existing works in data integration consider little knowledge about the above applications. In such settings, queries from the same application are processed independently. In this paper, application properties are noticed in order to improve query performance for data integration. We present a general-purpose and wellmodular architecture for addressing data integration in grid (DIG) environment first, the modules of which can be flexibly deployed to adapt specific application. Moreover, special attention has been paid on query processing to accommodate application workflow with the component of Query Flow Processor. It introduces multi-query optimization techniques to speed up overall response time for DIG.
Toward the Realization of Policy-Oriented Enterprise Management
Authors: Matthias Kaiser
Venue: Computer (2007)

A goal-driven approach to business process composition uses generic, logic-based strategies, descriptions of Web services, and formalized business policies to generate business processes that satisfy the stated business goals. The approach is based on an enterprise physics metaphor, in which business objects are analogous to physical objects and policies are analogous to physical laws.
Towards an Automated Test Generation with Delayed Transitions for Timed Systems
Authors: Elisangela Rodrigues Vieira, Ana Cavalli
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In this paper we analyze the influence of the urgency in the timed transitions, and as consequence, in the test suite generation. As result, we formalize rules to generate sequences where the messages exchanged may be instantaneous or delayed. In addition, the generated scenarios are able to detect timing faults. For test generation, we use a prototype tool called HJ2IF. It is based on a test purpose algorithm, called Hit-or-Jump and it is applied for systems specified using Intermediate Format language (IF).
Capital-Intensive Software Technology Part 2: Programming in the Large
Venue: IEEE Software (1984)

Reusability is a central concept in life-cycle technology, in system evolution, and in the development of theories and models. 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
Computation of consensus hydrophobicity scales with self-organizing maps and fuzzy clustering along with applications to protein fold prediction
Authors: Nikhil Ranjan Pal, Somitra Kumar Sanadhya, Animesh Sharma
Venue: Neural, Parallel Scientific Computations (2007)

Hydrophobicity is probably the most important property of amino acid that is being often exploited to predict protein folds. There are many amino acid hydrophobicity scales available in the literature. Here we propose two computational approaches based on self-organizing map (SOM) and fuzzy clustering to find some consensus scales. Although SOM and fuzzy clustering produce centroids, we propose new schemes to compute more effective representative scales that exploit the properties of SOM and fuzzy memberships. To demonstrate the utility of the new scales, we apply them to predict the protein folds of a benchmark data set using neural networks. Our experiments show that it is possible to generate useful scales with better utility compared to some existing scales. There can be other applications of the proposed scales.
Extending Sensor Networks Lifetime Through Energy Efficient Organization
Authors: Trac N. Nguyen, Dung T. Huynh
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

In most applications involving wireless sensor networks, each sensor collects data in the surrounding area, and sends to a central node for processing. To extend network lifetime in such cases, the sensors could be partitioned into groups which are successively scheduled to be active for sensing and delivering data. Each group covers (almost) the entire area, and only one group is active at a given time. These groups of sensors are known as disjoint dominating sets in network and graph theory where it has been shown that the problem of computing the maximum number of disjoint dominating sets in graphs is NP-complete [6]. In this paper, we strengthen this result [3] by showing that this problem remains NP-complete for planar unit disk graphs. We introduce several heuristics for the disjoint dominating sets problem and discuss their performance through some simulation results.
An empirical investigation of mobile ticketing service adoption in public transportation
Authors: Niina Mallat, Matti Rossi, Virpi Kristiina Tuunainen, Anssi Öörni
Venue: Personal and Ubiquitous Computing (2008)

In this paper, we present results from a study of mobile ticketing service adoption in public transportation. The theoretical background of the study is based on technology adoption and trust theories, which are augmented with concepts of mobile use context and mobility. Our empirical findings from analyses of a survey data suggest that compatibility of the mobile ticketing service with consumer behavior is a major determinant of adoption. Mobility and contextual factors, including budget constraints, availability of other alternatives, and time pressure in the service use situation were also found to have a strong effect on the adoption decision. Our findings suggest that contextual and mobile service-specific features are important determinants of mobile service adoption and should thus be integrated into the traditional adoption models.
A performance analysis of the IRIDIUM&reg; low earth orbit satellite system with a degraded satellite constellation
Authors: Carl E. Fossa, Richard A. Raines, Gregg H. Gunsch, Michael A. Temple
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1998)

There are currently several commercial Low Earth Orbit (LEO) satellite systems under development that will provide worldwide voice, data, facsimile, and paging services. This article presents a performance analysis of the IRIDIUM&reg; LEO satellite system, as several satellites become non-operational. The analysis is conducted using a computer simulation of the system. First, it examines the system's capability to meet real-time communications constraints of end-to-end delay and packet rejection rate with non-operational satellites. Then, it examines the effects of these non-operational satellites on a user's ability to access the network. The analysis is conducted at low, medium and high traffic loading levels with both uniform and non-uniform traffic distributions. The results indicate that the IRIDIUM&reg; system is capable of providing real-time voice communications with several non-operational satellites. Both the loading level and the traffic distribution have a significant effect on the performance of the system.
Defining the asymptotics for one class of singularly perturbed problems of vibrational mechanics
Authors: E. A. Kolpakova, N. N. Subbotina
Venue: Automation and Remote Control (2007)

In this paper, a solution algorithm for the optimal control problem for the system with uncertain dynamics which is the asymptotics of the singularly perturbed system with fast oscillator is proposed.
A Special-Purpose Computer for Digital Signal Processing
Authors: R. De Mori
Venue: IEEE Transactions on Computers (1975)

This paper describes a special-purpose processor for use in performing various operations on sampled signals. The system is fast, flexible, and programmable for performing, in real time, operations such as fast Fourier transformation (FFT) and digital filtering of acoustically derived signals.
Iterative Solution of Linear Equations on a Parallel Processor System
Authors: V. Conrad
Venue: IEEE Transactions on Computers (1977)

A parallel processor system and its mode of operation are described. A notation for writing programs on it is introduced. Methods for iterative solution of a set of linear equations are then discussed. The well-known algorithms of Jacobi and Gauss-Seidel are parallelized despite the apparent inherent sequentiality of the latter. New, parallel methods for the iterative solution of linear equations are introduced and their convergence is discussed. A measure of speedup is computed for all methods. It shows that in most cases the algorithms developed in the paper may be efficiently executed on a parallel processor system.
Routing Schemes for the Augmented Data Manipulator Network in an MIMD System
Authors: R. J. McMillen
Venue: IEEE Transactions on Computers (1982)

There have been many multistage interconnection networks proposed in the literature for interconnecting the processors that comprise large parallel processing systems. In this paper, the use of the Augmented Data Manipulator and Inverse Augmented Data Manipulator multistage networks in the MIMD mode of operation is considered. A tag based routing scheme which allows distributed control of either network is proposed. Rerouting schemes that allow a message blocked by a busy or known faulty node in its present path to dynamically make use of a nonbusy node and continue, when possible, are described for both networks. Finally, a tag based broadcasting scheme for the networks is introduced that allows one processor to send messages to a subset of the other processors.
A New J-K Flip-Flop for Synchronizers
Authors: G. Elineau
Venue: IEEE Transactions on Computers (1977)

Anomalous gating of asynchronous signals in synchronizers and arbiter circuits may cause significant errors and system failures. Since the probability of logically undefined states at the output of flip-flops increases rapidly with clock rate, the errors were reduced by lower frequencies, at the price of severe time loss, until now. The paper presents a J-K flip-flop in which the duration of an oscillatory or metastable behavior is reduced by a factor of 5 to 15. In this flip-flop the switching of two gates is accelerated by tunnel diodes.
Measuring and Managing Software Maintenance
Authors: R. B. Grady
Venue: IEEE Software (1987)

An effective way to improve software quality is to set measurable goals and then manage your projects to achieve those goals. Hewlett-Packard has developed some methods to do just that. 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
A New Kind of Hybrid Filter Based on the Peak-and-Valley Filter and PCNN
Authors: Yun Liu, Xiang-guang Zhang, Chuan-xu Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Pulse Coupled Neural Network (PCNN) has gained widely research as a new artificial neural network. It derives directly from the studies of the small mammal's visual cortex. The Peak-and-Valley filter can keep the details of image sufficiently if the density of noise is low enough. But for the image that is badly contaminated with noise, the effect of the Peak-and- Valley filter is inadequate. To overcome this shortage, this paper suggests a kind of designing project of the hybrid filter that applies the ideas of the PCNN and the Peak-and-Valley filter. PCNN is a model with multiple parameters and finding the proper values of these parameters is an onerous task. So a simplified PCNN is put forward and its performance in removing Salt-and-pepper noise of image is discussed in this article. The theory analysis and the simulation experiments of the image processing indicate that this kind of filter can not only remove noise effectively but also keep the details of the image sufficiently.
Gingko: correlating causal paths in distributed systems
Authors: Zhihong Zhang, Dan Meng, Jianfeng Zhan, Lei Wang, Yi Jin, Yu Wen, Hui Wang
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Many large-scale systems are distributed systems of multiple communicating components. Finding causal paths of message traces between components throughout these systems is important to uncover runtime behaviors and identify the root cause of failures, but this "art often hides in the heads of developers or domain experts. Our goal is to design tools and algorithms to help developers record this art into logs and help the modestly-skilled users and system administrators master it to make better use and management of distributed systems. In this paper, we present a methodology that automatically builds the causal paths of message traces by 1) an agreement with programmers on the style and content of logs produced by operational distributed systems they develop and 2) a correlation algorithm to build message causal paths with the clues from these logs. To validate this mechanism, we have implemented Gingko, a prototype providing a tool chain for users to gain better comprehensions of distributed systems and to debug them efficiently when errors happen.
Management Location Service - to Auto-Configure Network Nodes with Domain Managers
Authors: GUO Nan, GAO Tianhan
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

As the network grows fast to large scale and heterogeneity, the distributed network management technologies do make management model flexible and scalable. However, to deal with the initial configuration of so large and complex the distributed system adds much more burden to network operators. Thus, Management Location Service (MLS) is proposed to make the configuration of network nodes with domain managers automatically. It employs mobile agent technology to implement the procedure of auto-configuration, which discovers new-added network nodes and makes the match between network nodes and domain managers through some strategy. Meanwhile, it is scalable in the distributed architecture the way of periodically exchanging the information of all the MLSs in a management system. Compared with the existing methods, it obviates the limitation of network division strategy, which is generally based on physical area, and makes domain generated by either logical area or network node type.
A radically new approach to the installation of optical fibre using the viscous flow of air
Authors: S. A. Cassidy, M. H. Reeve
Venue: BT Technology Journal (2007)

A method of installing optical fibres in pre-installed cable bores using compressed air has been developed. The method results in very low fibre strains and avoids the need for many fibre joints. Analysis of the forces involved shows that installations of 600 m in 6 mm bores are achievable using the compressors already available on UK cabling vehicles.
Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games
Venue: Network and System Support for Games (2007)

The NetGames workshop brings together researchers and developers from academia and industry to present new research in understanding networked games and in enabling the next generation of them. Submissions are sought in any area related to networked games. In particular, topics of interest include (but are not limited to) game-related work in: &bull; Network measurement, usage studies and traffic modeling &bull; System benchmarking, performance evaluation, and provisioning &bull; Latency issues and lag compensation techniques &bull; Cheat detection and prevention &bull; Service platforms, scalable system architectures, and middleware &bull; Network protocol design &bull; Multiplayer mobile and resource-constrained gaming systems &bull; Augmented physical gaming systems &bull; User and usability studies &bull; Quality of service and content adaptation &bull; Artificial intelligence &bull; Security, authentication, accounting and digital rights management &bull; Networks of sensors and actuators for games &bull; Impact of online game growth on network infrastructure &bull; Text and voice messaging in games Netgames 2007 will be held in Melbourne, Australia September 19-20th, 2007. The conference is being hosted by the Centre for Advanced Internet Architectures, and will be located on the inner-city campus of Swinburne University of Technology.
SenseWeb: An Infrastructure for Shared Sensing
Authors: Aman Kansal, Suman Nath, Jie Liu, Feng Zhao
Venue: IEEE MultiMedia (2007)

Web 2.0 is an emerging paradigm for applications and user interactions. In this article, Aman Kansal, Suman Nath, Jie Liu, and Feng Zhao from Microsoft Research discuss the development of SenseWeb, a peer-produced sensor network environment, used for everyday life decisions.
Weak and strong convergence to common fixed points of non-self nonexpansive mappings
Authors: Yongfu Su
Venue: Journal of Applied Mathematics and Computing (2007)

Suppose K is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach space E with P as a nonexpansive retraction. Let T1, T2 and T3 : K → E be nonexpansive mappings with nonempty common fixed points set. Let {αn}, {βn}, {γn}, {α′n}, {β′n}, {γ′n}, {α″n}, {β″n} and {γ″n} be real sequences in [0, 1] such that αn+βn+ γn=α′n + β′n + γ′n = α″n + β″n + γ″n = 1, starting from arbitrary X1 ε K, define the sequence {xn} by {zn = P(α″nT1xn + β″nXn + γ″nwn) Yn = P(α′nT2zn + β′nxn + γ′nvn) xn+1 = PαnT3yn + βnxn + γnun) with the restrictions Σn=1∞ γn < ∞, Σn=1∞γ′n < ∞, Σn=1∞ γ″n < ∞. (i) If the dual E* of E has the Kadec-Klee property, then weak convergence of a {xn} to some x* ∈ F(T1) ∩ F(T2) ∩ (T3) is proved; (ii) If T1, T2 and T3 satisfy condition (A′), then strong convergence of {xn} to some x* ∈ F(T1) ∩ F(T2) ∩ (T3) is obtained.
PERQ and Advanced Raster Graphics Workstations
Authors: F. R. A. Hopgood
Venue: IEEE Computer Graphics and Applications (1982)

A National Network of Inexpensive, High-Powered, Single-User Computers with Good Interactive Capabilities Is Being Launched in the UK.
A Nonlinear-Shift Approach to Object Tracking Based on Shape Information
Authors: M. Asadi, A. Beoldo, C. S. Regazzoni
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper presents a corner-based method for tracking objects in video image frames. The method uses a vectorial shape representation based on relative object main corners positions and a non-linear voting method to evaluating the new object position at each iteration. The initialization consists of individuating an area including the object to be tracked. Information of the corners distribution around a reference point is used to find the most probable target position in the next frame. The method can be used in both fixed and mobile cameras both for vehicles and pedestrians.
Fuzzy System Based on Class Association Rules
Authors: Ren Jia, Zhang Yibo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Fuzzy system has been proved to be a universal approximator, yet the curse of dimensionality is still the unsolved problem for it. Class association rules (CARs) are interesting and frequent patterns derived from data through adapted Apriori algorithm. Using CARs to build the fuzzy rule base of fuzzy system can solve the curse of dimensionality problem effectively. Thus, a novel fuzzy system based on CARs is proposed in this paper. The process of how to build the fuzzy system and its whole execution are presented in detail. Furthermore, comparative experiments are also made to prove the effectiveness of the presented strategy.
Steady-State Probabilities for a Queue with a General Service Distribution and State-Dependent Arrivals
Authors: R. A. Marie
Venue: IEEE Transactions on Software Engineering (1983)

We consider a queueing system with a general service distribution having a possibility of feedback. The customers belong to the same class, and the queueing discipline is first-in, first-out. There is only one server in the station. The facility is rendered Markovian by means of fictitious stages. The input flow depends on the state of the station. It is shown that the equilibrium probabilities can be simply expressed by means of a matrix product. Two particular cases are studied.
TV-anytime phase 1 and MPEG-7
Authors: Jean-Pierre Evain, José M. Martínez
Venue: Journal of the American Society for Information Science and Technology (2007)

Personal video recorders have the capability to change the media delivery industry fundamentally, and in this context, many believe the real international age of personal digital recorders (PDRs) will arrive with the use of "open" systems. The world reached an important milestone with the publication of the TV-Anytime Phase 1 specifications for unidirectional broadcast and metadata services over bidirectional networks. TV-Anytime is a worldwide prestandardization body; this article gives an overview of the main features of TV-Anytime's metadata specification and its relationship to MPEG-7 and provides insight into ways two organizations concerned with standards work together. Phase 2 has since been completed and TV-Anytime has been adopted by various international standards organizations dealing with telecommunications and is now in the implementation phase.