ppxscal/embedding_network huggingface dataset:
Video quality estimation in wireless IP networks: Algorithms and applications
Authors: Fulvio Babich, Marco D'orlando, Francesca Vatta
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2008)

This article proposes three methods to estimate the distortion deriving from packet losses in wireless video communication. The proposed methods take into account the short-term properties of the encoded video sequences. A suitable set of functions is adopted to model the distortion envelope resulting from multiple losses. The estimated performance is compared with the actual distortion, evaluated by decoding the received sequence with a properly designed decoder. Numerical results confirm the accuracy of the proposed models in approximating the actual Mean Square Error (MSE) for a wide range of loss rates. Some applications of the proposed algorithms are presented.
Supporting time-constrained SQL queries in oracle
Authors: Ying Hu, Seema Sundara, Jagannathan Srinivasan
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate amount of time to complete. To mitigate this problem, strategies that are optimized to return the 'first-few rows' or 'top-k rows' (in case of sorted results) are usually employed. However, both these strategies can lead to unpredictable query processing times. Thus, in this paper we propose supporting time-constrained SQL queries. Specifically, a user issues a SQL query as before but additionally provides nature of constraint (soft or hard), an upper bound for query processing time, and acceptable nature of results (partial or approximate). The DBMS takes the criteria (constraint type, time limit, quality of result) into account in generating the query execution plan, which is expected (guaranteed) to complete in the allocated time for soft (hard) time constraint. If partial results are acceptable then the technique of reducing result set cardinality (i.e. returning first few or top-k rows) is used, whereas if approximate results are acceptable then sampling is used, to compute query results within the specified time limit. For the latter case, we argue that trading off quality of results for predictable response time is quite useful. However, for this case, we provide additional aggregate functions to estimate the aggregate values and to compute the associated confidence interval. This paper presents the notion of time-constrained SQL queries, discusses the challenges in supporting such a construct, describes a framework for supporting such queries, and outlines its implementation in Oracle Database by exploiting Oracle's cost-based optimizer and extensibility capabilities.
Life Cycle Analysis of an Ada Project
Authors: J. Baskette
Venue: IEEE Software (1987)

How does Ada affect cost? A cost-prediction model developed during this project is compared with six popular models to reveal Ada's effect on design, coding, and testing. 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
Application of GM(1,1) Optimized Model in Prediction of Landslide
Authors: Xiao-guang Jin, Jie Zeng, Xin-rong Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Grey system theory is a new cross course founded in 1982 by Prof. Deng Ju-long, a Chinese famous scholar. Grey model of the theory was applied extensively and gained a series of significant achievement both in natural science and social science. It is mainly applied in midlong- term forecasting of slope or landslide and has high accuracy in geologic catastrophe study. However, when applied in short-impending slip forecasting, it produces relatively poor accuracy, even not suit the study. There is still much room for its improvement. Actual counting examples of slide deformation forecasting indicated that optimized model GM(1,1) based on ground value of optimized grey model had an ability to optimize modeling results; it can be applied with relative high modeling and forecasting accuracy not only in mid-long-term forecasting of slope deformation, but also in short-impending slip forecasting of landslide. In this paper, correctness and extensive application of the optimized model GM (1,1) were tested by analysis of the contrast between original linear model GM(1,1) and non-linear model Verhulst. The study will not only enrich research methods of landslide deformation forecasting, but is also of momentous theoretical and practical significance.
Program Restructuring in a Multilevel Virtual Memory
Authors: E. J. Lau
Venue: IEEE Transactions on Software Engineering (1983)

Program restructuring techniques have proven successful in two-level automatically managed memory hierarchies. The possibility of extending them to multilevel environments is investigated. The performance of strategy-oriented restructuring algorithms in a three-level linear hierarchy managed by sampled working set policies or by a combination of sampled working set and local LRU policies is studied both analytically (assuming an independent reference model of program behavior) and by trace-driven simulation. The results of the study show that strategy-oriented restructuring may be as beneficial in a virtual memory with three levels as it is in one with two levels.
An Encryption solution in Digital Trunking System
Authors: Wei Chongyu, Wang Chengjin, Zhou Chunlin
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

An encryption solution completed in a DTS is introduced. This solution consists of system management for cipher key and E2EE. For cipher key management, a server is used in the system. The E2EE is designed on the basis of a platform using OMAP5910 as a primary processor. Interface for information exchange is depicted in brief.
Guest Editorial: Reliability Issues in Distributed Systems
Authors: B. Bhargava
Venue: IEEE Transactions on Software Engineering (1982)

TO provide continuity of operations in automated systems, we need to develop techniques that can make them reliable. Many systems such as used in space programs, air traffic control, nuclear plant monitors, ballistic missile defense, etc., demand robust operation. In the past, research efforts have focused on the design and implementation of distributed systems used in such applications. We foresee a need of research effort in the investigation of algorithms and system structures that make error/failure detection, reconfiguration, recovery, and restart of a system feasible with the least amount of interruptions. 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
Comparison of the Task Performances with the Multi-display Computer
Authors: Keun-Sang Park, Young-deog Yun, Chang-Han Kim, Seoung-Soo Lee
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

For this study we are going to apply a type of computer tasks which are used in an actual control room. Subjects are supposed to perform the primary task (typing task watching the main monitor) and the secondary task (clicking targets with the mouse, which appear randomly in the sub-monitor) at the same time. The secondary tasks were differentiated with three different task intensities. During the experiment, the primary and secondary tasks were measured and evaluated depending on the intensities of the subtasks and the locations of the sub-monitors. Followings are the conclusions which were obtained after the evaluation: 1) The higher the task intensity is, the lower the task performance. 2) Regardless of the task intensity, the task performance of the subtask is high in the center of the monitor. When the task intensity is low, the center section of the monitor becomes the starting point for searching. 3) When the task intensity is high, the task performance in the left section of the monitor becomes low.
A geometric approach for solving fuzzy linear programming problems
Authors: M. R. Safi, H. R. Maleki, E. Zaeimazad
Venue: Fuzzy Optimization and Decision Making (2007)

In this paper we first recall some definitions and results of fuzzy plane geometry, and then introduce some definitions in the geometry of two-dimensional fuzzy linear programming (FLP). After defining the optimal solution based on these definitions, we use the geometric approach for obtaining optimal solution(s) and show that the algebraic solutions obtained by Zimmermann method (ZM) and our geometric solutions are the same. Finally, numerical examples are solved by these two methods.
The Military Computer Family: a New. Joint-Service Approach to Military Computer Acquisition
Authors: A. H. Coleman
Venue: Computer (1977)

A new approach to developing and acquiring computers for the military has been under development over the past 2½ years by the Army's Electronics Command and the Navy's Air Systems Command. Known as the Military Computer Family Program, the joint effort now includes the Air Force's Electronic Systems Division and Rome Air Development Center (as observers). It is aimed at providing defense system developers with a software-compatible family of military computers that have extensive systems/support software. The various phases of the work being performed under the MCF Program are the subject of the principal articles in this issue. The overall objectives and major thrusts are summarized below.
Performance Study of Cryptographic Storage Area Network
Authors: Tao Cai, Shiguang Ju, JunJie Zhao, Wei Zhong
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Encryption is the basis and important method to ensure security of storage area network. And it is very expensive and will drop off performance of storage area network system to unacceptable situation. We evaluate performance of encrypted storage area network using some current cryptographic algorithms, and want to observe some useful result to help researching and designing security system for storage area network.
Reducing irrelevant trace variations
Authors: Madeline Diep, Sebastian Elbaum, Matthew Dwyer
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Identifying truly distinct traces is crucial for the performance and practicality of many dynamic analysis activities. For example, given a trace pool resulting from program failures, identifying the set of distinct traces can reduce the debugging effort by more quickly producing a smaller set of candidate fault locations. The process of discriminating valuable traces, however, is subject to the presence of irrelevant variations in the trace constitution, i.e., the sequence of events in a trace, that can make a trace appear unique when it is not, leading to the retention of a trace that adds no value. In this paper we present an approach to address inconsequential and potentially detrimental trace variations. The approach decomposes traces into segments on which irrelevant variations caused by event ordering or repetition can be detected and removed. The approach is illustrated on two well-known client dynamic analyses and is supported by an infrastructure to explore the approach
Experimental Results of Transition Fault Simulation with DC Scan Tests
Authors: Wataru Kawamura, Takeshi Onodera
Venue: Proceedings of the 16th Asian Test Symposium (2007)

At-speed testing has become necessary to guarantee high quality products of 90nm processes and beyond. AC Scan test generation usually targets transition faults. In general, the transition test pattern count with high fault coverage is becoming several times larger than stuck-at test pattern count generated by DC Scan. This results in increases in manufacturing test costs. Thus the effective test compaction of AC Scan tests is highly desirable.
Reseach on Three-Dimensional Fluoroscopic Navigation in Neural Surgical Operation
Authors: Guiyun Ye, Changzheng Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The major shortcoming of image-guided navigational systems is the use of presurgically acquired image data, which does not account for intraoperative changes in brain morphology. The occurrence of these surgically induced volumetric deformations, or "brain shift", has been well established. Maximum measurements for surface and midline shifts were reported. There is no detailed analysis, however, of the changes occurring throughout the entire surgery. Intraoperative MRI provides a unique opportunity to obtain serial imaging data and characterize the time course of brain deformations during surgery. Serial acquisitions allow a comprehensive sequential description of the direction and magnitude of intraoperative deformations. Brain shift occurs at various surgical stages and at different regions. Surface shift occurs throughout surgery and is mainly due to gravity. Subsurface shift occurs during resection involving collapse of the resection cavity and intraparenchymal changes that are difficult to model. Brain shift is a continuous dynamic process, which evolves differently in distinct brain regions. Therefore only serial imaging or continuous data acquisition provide consistently accurate image guidance.
Micro-Blog: map-casting from mobile phones to virtual sensor maps
Authors: Shravan Gaonkar, Romit Roy Choudhury
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

The synergy of phone sensors (microphone, camera, GPS, etc.), wireless capability, and ever-increasing device density can lead to novel people-centric applications. Unlike traditional sensor networks, the next generation networks may be participatory, interactive, and in the scale of human users. Millions of global data points can be organized on a visual platform, queried, and sophistically answered through human participation. Recent years have witnessed the isolated impacts of distributed knowledge sharing (Wikipedia), social networks, sensor networks, and mobile communication. We believe that significant more impact is latent in their convergence, that can to be drawn out through innovations in applications. This demonstration, called Micro-Blog, is a first step towards this goal.
Workshop Report: Fault-Tolerant VLSI Design
Authors: D. Siewiorek
Venue: Computer (1980)

Contemporary integrated circuits contain as many components as the largest computing systems of 15 to 20 years ago. The age of VLSI is here, and its technology is presenting interesting potentials as well as challenges. The increased component count provides the opportunity for increased functionality and/or overhead such as built-in-test circuits or structured, top-down design methodologies. At the same time, shrinking device dimensions increase system susceptibility to small energy perturbations. For example, alpha particles from trace elements in packaging material have been observed causing "soft" errors in dynamic MOS RAM chips.
Examination of Processing Load in Applying DACS Scheme to Practical Network
Authors: Kazuya Odagiri, Rihito Yaegashi, Masaharu Tadauchi, Naohiro Ishii
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The study of DACS Scheme, which manages a whole network system by communication control on a client computer, has been advanced. On the network introducing DACS Scheme, when configuration change of the network system is carried out, a client computer can be used without changing setups. So far, functions of DACS Scheme and of network service which is realized on the network introducing DACS Scheme have been studied. The problem for applying DACS Scheme to practical network is that, processing load is heavy at the time of controlling communication because communication is controlled by a user unit. Function of controlling communication by a user unit has been used in SSL-VPN and Opengate. However, the study for the purpose of managing a whole network system by communication control by a user unit, isn't reported except DACS Scheme. Therefore, we propose models for managing a whole network system; Course management type model and Client management type model. At the point of processing load which occurs at the time of controlling communication, these two models are compared. From comparing results, it is shown that, DACS Scheme with Client management type model is advantageous at the point of processing load which occurs at the time of control communication.
A Dynamic Memory Allocation Algorithm
Authors: D. P. Bovet, G. Estrin
Venue: IEEE Transactions on Computers (1970)

A dynamic memory allocation algorithm is presented making use of a priori information about a computer program. A two- level storage system is assumed, and a replacement algorithm is developed based upon a priori knowledge of interaction factors between any two space-taking entities associated with a computation.
Loop Properties and Controllability of Linear Congruential Sequences
Authors: E. A. Galperin
Venue: IEEE Transactions on Computers (1978)

Loop properties of linear congruential sequences generated by Xn+1 = AXn + C (mod m) are considered. Existence theorems and procedures are given to single out loops and fixed points, if any, in terms of generator parameters X0,A,C,m. Criteria are found for absolutely and conditionally convergent generators and split generators. The role of parameters in respect of inner structure is investigated. Nonautonomous random number generators are introduced and applied to the design of a generator (mod 232) having a good lattice, a period five times more than the modulus and no translated-block structure.
Hitch haiku
Authors: Naoko Tosa, Hideto Obara, Michihiko Minoh, Seigow Matsuoka
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

HAIKU is a Japanese classical poem style with minimal length of 5-7-5 characters including a seasonal word called "Kigo", the late 19th century revision by Shiki Masaoka of the older hokku. Such imaginative expression has been applauded by many people. Haiku is a story that generates context - the shortest story in the world. Known as the first great haiku poet in the Japanese history, Matsuo Basho is responsible for "Oku No Hosomichi," a prime example of his work. We present the new interactive system, "Hitch Haiku," which supports a user for composing a haiku. The user inputs some words into the system, and the system chooses the most related phrase with the user inputs. The system generates a haiku "hitching" the phrases chosen and the user inputs. If the user does not like the haiku, the user can modify the haiku and make the system learn better haiku.
A probabilistic counting lemma for complete graphs
Authors: Stefanie Gerke, Martin Marciniszyn, Angelika Steger
Venue: Random Structures Algorithms (2007)

We prove the existence of many complete graphs in almost all sufficiently dense partitions obtained by an application of Szemerdi's regularity lemma. More precisely, we consider the number of complete graphs Kℓ on ℓ vertices in ℓ-partite graphs where each partition class consists of n vertices and there is an &epsilon;-regular graph on m edges between any two partition classes. We show that for all &beta; > 0, at most a &beta;m-fraction of all such graphs contain a little less than the expected number of copies of Kℓ provided &epsilon; is sufficiently small, m >> n2-1/(ℓ-1), and n is sufficiently large. This result is a counting version of a restricted version of a conjecture (Kohayakawa, Luczak, and R&ouml;dl, Combinatorica 17 (1997), 173213), and it is well known that this result implies several results for random graphs. &copy; 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007
Aardvark et al.: quality journals and gamesmanship in management studies
Authors: Stuart Macdonald, Jacqueline Kam
Venue: Journal of Information Science (2007)

Publication in quality journals has become a major indicator of research performance in UK universities. This paper investigates the notion of `quality journal' and finds dizzying circularity in its definitions. Actually, what a quality journal is does not really matter: agreement that there are such things matters very much indeed. As so often happens with indicators of performance, the indicator has become the target. So, the challenge is to publish in quality journals, and the challenge rewards gamesmanship. Vested interests have become particularly skilful at the game, and at exercising the winners' prerogative of changing the rules. All but forgotten in the desperation to win the game is publication as a means of communicating research findings for the public benefit. The paper examines the situation in management studies, but the problem is much more widespread. It concludes that laughter is both the appropriate reaction to such farce, and also, perhaps, the stimulus to reform.
Multi-Frequency Modular Testing of SoCs by Dynamically Reconfiguring Multi-Port ATE
Authors: Dan Zhao, Ronghua Huang, Hideo Fujiwara
Venue: Proceedings of the 16th Asian Test Symposium (2007)

With the debut of a new class of multi-port ATE (e.g., Agilent 93000 series), there is a pressing need for test planning methods to fully adapting SoC test framework design to the new concurrent test capabilities and fulfil emerging demands of high-speed testing. In this paper, we propose a new test planning strategy that addresses multi-frequency SoC testing by dynamically reconfiguring ATE ports. The system integrators on-the-fly group pins into virtual ports while ATE ports simultaneously drive the testing of a set of cores at multiple independent clock domains. An effective and efficient system optimization technique is developed to manage test resources and improve test efficiency for modern complex SoC designs.
Service-oriented software and systems engineering - a vision for the automotive domain
Authors: I. H. Kruger
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

Increasing interactions among automotive software functions and the ensuing complexity demand new ways of developing automotive systems. Many functions deployed in the vehicle cut across physical and logical boundaries. Capturing the core interactions underlying system functions, creating logical service architectures and mapping them to varying deployment architectures and product lines are central development tasks that cross-cut requirements capture, architecture design, implementation and validation/verification. The service-oriented development approach we propose addresses these fundamental aspects of automotive system design. In this talk the author demonstrate the description techniques, methodology and tools we have developed, and discuss their application in the context of automotive case studies.