ppxscal/embedding_network huggingface dataset:
A Highly Scalable GALS Crossbar Using Token Ring Arbitration
Authors: Tejpal Singh, Alexander Taubin
Venue: IEEE Design Test (2007)

This article presents a new low-latency crossbar design that can be used to interface systems working at different frequencies. For the case of multiple input ports contending for the same output port, contemporary designs provide localized arbitration solutions. The arbitration circuitry itself is a major contributor to the area and latency of the crossbar. This hinders the scalability of contemporary designs. The authors present a crossbar that uses a distributed arbitration mechanism in the form of token rings. This implementation provides a highly scalable solution, in terms of both area and latency.
PassShape: stroke based shape passwords
Authors: Alexander De Luca, Roman Weiss, Heinrich Hussmann
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Authentication today mostly means using passwords or personal identification numbers (PINs). The average user has to remember an increasing amount of PINs and passwords. But unfortunately, humans have limited capabilities in remembering abstract alphanumeric sequences. Thus, many people either forget them or use very simple ones that imply several security risks. In our previous work on PIN entry on ATMs (cash machines), we found out that many persons support their memory recalling PINs by using an imaginary shape overlaid on the number pad. In this paper, we introduce PassShape, a shape based authentication mechanism. We argue that using shapes will allow more complex and more secure authentication with a lower cognitive load. That is, it enables people to use easy to remember but complex authentication patterns.
Balancing Risk and Price: An Opportunity-Cost Approach for Job Scheduling in the Grid Market
Authors: Kai Shen, Shoubao Yang, Wei Chen, Xiaoqian Liu, Bin Wu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

The previous deadline and budget constrained (DBC) algorithms were proposed to optimize the user's cost in market-based job assignment. However those algorithms are not suitable for unreliable grid environment. An opportunity-cost guided algorithm is proposed for job scheduling to bridge this gap. By employing trust mechanism into the grid market, this approach takes both of resource's explicit cost and the successful opportunity into considerations. Von Neumann-Morgenstern utility function (VNM-UF) from the traditional economy theory is applied to characterize the user's risk bias. A quantitative method is given. Simulations show our approach is more suitable for unreliable environment than many other existing approaches. The job failure rate is reduced to 30% and the total cost saves by 8%~10% averagely.
Effective random testing of concurrent programs
Authors: Koushik Sen
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Multithreaded concurrent programs often exhibit wrong behaviors due to unintended interferences among the concurrent threads. Such errors are often hard to find because they typically manifest under very specific thread schedules. Traditional testing, which pays no attention to thread schedules and non-deterministically exercises a few arbitrary schedules, often misses such bugs. Traditional model checking techniques, which try to systematically explore all thread schedules, give very high confidence in the correctness of the system, but, unfortunately, they suffer from the state explosion problem. Recently, dynamic partial order techniques have been proposed to alleviate the problem. However, such techniques fail for large programs because the state space remains large in spite of reduction. An inexpensive and a simple alternative approach is to perform random testing by choosing thread schedules at random. We show that such a naive approach often explores some states with very high probability compared to the others. We propose a random partial order sampling algorithm (or RAPOS) that partly removes this non-uniformity in sampling the state space. We empirically compare the proposed algorithm with the simple random testing algorithm and show that the former outperforms the latter
New Products
Authors: D. A. Michalopoulos
Venue: Computer (1975)

In a recent four-part product announcement, Computer Automation, Inc., introduced a pair of computers that expand the firm's reach "from the fast-growing microcomputer market all the way to the large-scale minicomputer market," according to Sol Zasloff, marketing vice president.
Efficient Multi-Dimensional Flow Correlation
Authors: W. Timothy Strayer, Christine Jones, Beverly Schwartz, Sarah Edwards, Walter Milliken, Alden Jackson
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Flow correlation algorithms compare flows to determine similarity, and are especially useful and well studied for detecting flow chains through "stepping stone" hosts. Most correlation algorithms use only one characteristic and require all values in the correlation matrix (the correlation value of all flows to all other flows) to be updated on every event. We have developed an algorithm that tracks multiple (n) characteristics per flow, and requires updating only the flow's n values upon an event, not all the values for all the flows. The n correlation values are used as coordinates for a point in n-space; two flows are considered correlated if there is a very small Euclidean distance between them. Our results show that this algorithm is efficient in space and compute time, is resilient against anomalies in the flow, and has uses outside of stepping stone detection.
Motion Estimation for Real Time Transmission on H.264/AVC
Authors: Hyosun Yoon, Hyesuk Kim, Miyoung Kim, Anh Nga Lai Thi, Gueesang Lee
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Motion Estimation (ME) limits the performance of the encoder in terms of encoding speed and image quality. However, its complexity is too high to be applied in real time applications. To reduce its complexity and maintain the image quality, the proposed method uses a hierarchical search strategy for integer pel ME. This strategy consists of symmetrical cross search pattern, multi-square grid search pattern and diamond search patterns. This hybrid search strategy places search points symmetrically and evenly that can cover the overall search area not to fall into the local minimum and to reduce the complexity. Experiment results show that the speedup improvement of the proposed method over Unsymmetrical-cross Multi-Hexagon grid Search (UMHexagonS) and Full Search (FS) can be up to 1.2 _ 6.6 times faster respectively. Compared to FS, the proposed method shows an average PSNR drop of 0.01 dB while showing an average PSNR gain 0.01 dB in comparison to UMHexagonS.
Probabilistic Automata with Monitored Final State Sets
Authors: C. De Renna E Souza
Venue: IEEE Transactions on Computers (1971)

Probabilistic automata with time-variant final state sets monitored, in an intuitive manner, by autonomous probabilistic automata are considered. It is shown that they include a scheme suggested by Turakainen as a particular case, and that they accept all the stochastic languages. If the monitors are started in stationary distributions, it is proved that such schemes will accept all and only the stochastic languages; other cases in which the languages can be shown to be stochastic follow, including the case in which the state transition matrix of the monitor is deterministic.
From plans to planning: the case of nursing plans
Authors: Glenn Munkvold, Gunnar Ellingsen, Eric Monteiro
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Drawing on a critical perspective stemming from socially informed studies of medicine, we analyze an ongoing effort to establish electronic nursing plans at the university hospital of central Norway (St. Olav's hospital). We argue for an alternative interpretation of the relative lack of success to date of making the nurses use the nursing plans. Rather than a preoccupation with the singular artifact the - plan - we emphasize the process of planning as a collective, ongoing and heterogeneous achievement. Our perspective on plans implies that they should be recognized as more of a network and less a singular artifact.
3D Anatomical Model Visualization within a Grid-Enabled Environment
Authors: Ian J. Grimstead, David W. Walker, Nick J. Avis, Frederic Kleinermann, John McClure
Venue: Computing in Science and Engineering (2007)

Medical undergraduate education and postgraduate training must adapt and adjust to the pressures and problems associated with traditional methods of teaching anatomy and pathology. The Resource-Aware Visualization Environment (RAVE) is a distributed, collaborative visualization system that supports complex models even with PDAs and other thin clients.
An Approach to the Timing Analysis of Hierarchical Systems
Authors: Marco Panunzio, Tullio Vardanega
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Two architectural paradigms for the development of hierarchical systems arguably stand out for their flexibility and ease of reconfiguration: the server-based architecture and the priority-band architecture. Whilst the former has been deeply investigated, the latter, a fresh addition to a mainstream programming language standard, still lacks an accurate study of its timing behaviour. In this paper we relate those two architectural paradigms and devise timing analysis equations for the priority-band systems off the solid roots of the server-based theory.
HAL: A High-Speed Logic Simulation Machine
Authors: Nobuhiko Koike, Kenji Ohmori, Tohru Sasaki
Venue: IEEE Design Test (1985)

The architecture of a very-high-speed logic simulation machine (HAL), which can simulate up to one-half million gates and2M-byte memory chips at a 5 ms clock speed, is described. This machine makes it possible to debug the total system?CPU, mainmemory, cache memory and control storage?before the actual machine is fabricated. HAL employs parallel and pipeline processing,and event-driven, block-level logic simulation. The prototype system for a 32-processor system has been constructed and isnow in use as a tool for large mainframe computer development. HAL is more than a thousand times faster than existing softwarelogic simulators.
Towards an optimal degree of design coupling through fuzzy analysis
Authors: Wynne Hsu, C. S. G. Lee
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

It has long been recognized that we need some fundamental, correct principles and methodologies to guide decision making in design. One important decision to be made in design is the determination of the optimal degree of design coupling among the components. Two components are physically coupled together if the design features of both components have been integrated to form one single physical component. This ability to decide on the optimal degree of design coupling has a direct impact on the number of components in the final design which, in turns, affects the maintainability, assemblability, testability, and adaptability of the resultant product. Design for assembly guidelines tell us to reduce the number of components in the final design. This implies that we should, as far as possible, strive for the highest degree of physical integration of parts. This may prove to be too simplistic a guideline. In this paper, we attempt to show that there exist circumstances where design coupling is undesirable. We then propose a systematic approach for determining the optimal degree of design coupling among the components.
A Load Balancing Strategy in Web Cluster System
Authors: Wu Yang, ShuangQing Li, DaiJie Cheng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

The capacity problem of Web server can be solved by Web cluster technology. The key point is load balancing strategy and algorithm. Traditional strategies are effective to some kinds of Web sites, but not suitable for all. A load balancing strategy and algorithm supporting QoS in Web cluster is proposed in this paper. The simulation experiments show that the system has better capacity.
A New Cascade Software Reliability Model
Authors: Qian Yin, Jiang Li, Kim Ho Bom, Ping Guo
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

There are many kinds of software reliability models at present. However, a universal model, which can be used in different types of reliability data set, is never existed until now. This phenomenon blocks the development of software reliability model. In order to resolve the problem on software reliability model's limitation and precision of model's prediction, this paper proposed a new kind of method, with which four classical models are combined with a feedback neural network to form a new model. With the real world software failure data set SYS1 and CSR1, we experimental investigated the new model and compared with four classical ones. It can be proved that the new model's performance to predict is much better than any one of four classical models, and what's more, it can be more widely used.
A New Learning Algorithm for Function Approximation By Incorporating A Priori Information Into Feedforward Neural Networks
Authors: Fei Han, Qing-Hua Ling
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In this paper, a new learning algorithm which encodes a priori information into feedforward neural networks is proposed for function approximation problem. The algorithm incorporates two kinds of constraints into single hidden layered feedforward neural networks, which are architectural constraints and connection weight constraints, respectively, from a priori information of function approximation problem. On one hand, the activation functions of the hidden neurons are a class of specific polynomial functions based on a priori information from Taylor series expansions of the approximated functions. On the other hand, the connection weight constraints are obtained from the first-order derivatives of the approximated functions. The new learning algorithm has been shown by theoretical justifications to have better generalization performance and faster convergence rate than other algorithms. Finally, several experimental results are given to verify the efficiency and effectiveness of our proposed learning algorithm.
An extension of the Analytical Hierarchy Process using OWA operators
Authors: Ronald R. Yager, Antoine Kelman
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

The Analytical Hierarchy Process (AHP) provides a comprehensive methodology for the solution of multicriteria decision problems which makes considerable use of comparison generated importances to help in the aggregation of lower order concepts in the formulation of higher order concepts. We introduce an extension of the Analytical Hierarchy Process using the Ordered Weighted Averaging (OWA) operators. This extension, which generalizes the aggregation process used in the AHP, allows more flexibility in the formulation of higher order concepts and provides the AHP an even greater facility for modeling human decision making. Using the OWA operators we are able to model situations where the number of sub-criteria needed to satisfy a higher order concept can be expressed in terms of linguistic quantifiers.
Letters: Exponential state estimation for recurrent neural networks with distributed delays
Authors: Tao Li, Shu-min Fei
Venue: Neurocomputing (2007)

In this paper, the delay-dependent state estimation problem for recurrent neural networks with both time-varying and distributed time-varying delays is investigated. Through available output measurements, a delay-dependent criterion is established to estimate the neuron states such that the dynamics of the estimation error is globally exponentially stable. The derivative of a time-varying delay satisfies @t@?(t)=
Audiovisual recognition of spontaneous interest within conversations
Authors: Bjöern Schuller, Ronald Müeller, Benedikt Höernler, Anja Höethker, Hitoshi Konosu, Gerhard Rigoll
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

In this work we present an audiovisual approach to the recognition of spontaneous interest in human conversations. For a most robust estimate, information from four sources is combined by a synergistic and individual failure tolerant fusion. Firstly, speech is analyzed with respect to acoustic properties based on a high-dimensional prosodic, articulatory, and voice quality feature space plus the linguistic analysis of spoken content by LVCSR and bag-of-words vector space modeling including non-verbals. Secondly, visual analysis provides patterns of the facial expression by AAMs, and of the movement activity by eye tracking. Experiments base on a database of 10.5h of spontaneous human-to-human conversation containing 20 subjects in gender and age-class balance. Recordings are fulfilled with a room microphone, camera, and headsets for close-talk to consider diverse comfort and noise conditions. Three levels of interest were annotated within a rich transcription. We describe each information stream and a fusion on an early level in detail. Our experiments aim at a person-independent system for real-life usage and show the high potential of such a multimodal approach. Benchmark results based on transcription versus automatic processing are also provided.
Trustworthiness Evaluation and Testing of Open Source Components
Authors: Anne Immonen, Marko Palviainen
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

The use of Open Source Components (OSCs) is rapidly increasing in software systems. One of the biggest obstacles for the use of OSCs is the fact that the software integrators can not be sure of the quality of the components. Thus, it is the responsibility of the integrators to perform the quality evaluation. When building products using OSCs, the integrators should have a clear method and tools that facilitate and automate the evaluation work. Our contribution is a method and tooling for trustworthiness evaluation and testing of OSCs. The method provides clear guidelines to assist the integrators to perform the evaluation in their own software development environment. The tooling assists in the technical trustworthiness evaluation, containing tools for reliability analysis and testing. The tools are independent, co-operating in the open source context.
Officer Garcia: a virtual human for mediating eyewitness identification
Authors: Brent Daugherty, Sabarish Babu, Brian Cutler, Larry Hodges
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

An analysis of court cases has revealed that the mistaken identification of the wrong person by victims and witnesses of a crime is the single most common error leading to the arrest and conviction of innocent people [Wells et al. 2006]. Recognizing the role of mistaken identification in erroneous conviction, a growing number of states and police departments have reformed their eyewitness identification procedures. In this paper, we investigate a new procedural reform: the use of a virtual officer who does not know the identity of the suspect in the lineup and therefore cannot bias the witness toward false identification.
A Lower Bound on the Complexity of Arbitrary Switching Function Realizers
Authors: W. E. Hansalik
Venue: IEEE Transactions on Computers (1972)

In this note, arbitrary switching function realizers and their complexity are defined. Then, a lower bound on the complexity is derived in terms of the number of such switching function realizers required to realize all Boolean functions of n variables.
Impact of the DES and AES Algorithms on PERS (A Specific Processor for Sensor Networks)
Authors: Alexandre Ponce de Oliveira, Edward David Moreno
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

This paper presents a specific processor for sensors networks (PERS), in a first approach, we used the point-to-point topology. We highlight its architecture, its limited instruction set, simulations and performance results when executes the AES and DES algorithm. We have implemented several versions of our PERS in FPGAs, our first version (simple processor) and finalize with our fourth version, which insert special instructions for the AES and DES algorithms.
The characteristic finite volume element methods for the two-dimensional generalized nerve conduction equation
Authors: Zhoufeng Wang, Zhiyue Zhang
Venue: Neural, Parallel Scientific Computations (2007)

In the paper, a fully discrete characteristic finite volume element method is introduced and analyzed for approximating the solution of a nonlinear-hyperbolic equation in 2-space variables. Piecewise quadratic trial functions and piecewise constant test functions are used to finally obtain error estimate O(Δt + h2). A numerical experiment is given which showed the method is practicable.
The distinctive role of lab practical classes in computing education
Authors: Simon, Michael de Raadt, Ken Sutton, Anne Venables
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

As part of a wide-ranging phenomenographic study of computing teachers, we explored their varying understandings of the lab practical class and discovered four distinct categories of description of lab practicals. We consider which of these categories appear comparable with non-lecture classes in other disciplines, and which appear exclusive to computing. An awareness of this range of approaches to conducting practical lab classes will better enable academics to consider which is best suited to their own purposes when designing courses.
A Cluster Based Service Discovery Model for Mobile Ad Hoc Networks
Authors: Hassan Artail, Haidar Safa, Hicham Hamze, Khaleel Mershad
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Mobile ad hoc networks, as a typical example of self-organized networks, represent an emerging and promising communication paradigm. Not only the variety of devices but also the diversity of services is continuously increasing. Such services must be provisioned in a flexible and distributed way without a central infrastructure. The discovery of such services is an involved task since it must cope with the high level of mobile device heterogeneity, degree of mobility, and take the limited device resources into account. In this paper, we propose a decentralized and scalable service discovery and invocation framework for ad hoc networks of clustered mobile devices. The basic idea is to use the clusterheads as service directory nodes to assist mobile nodes in the network in finding desired services. In addition to storing the descriptions of services that fall in their clusters, clusterheads also cache descriptions of services that are retrieved from other clusters as they are requested. Experimental analyses are conducted to study the performance of the proposed architecture and to compare it with the broadcast-based model that has been extensively studied in the literature.