ppxscal/embedding_network huggingface dataset:
Functional Extension for Solving the Loophole Problem of DACS Scheme
Authors: Kazuya Odagiri, Rihito Yaegashi, Masaharu Tadauchi, Naohiro Ishii
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Where customers with different membership and position, use computers as in the university network systems, it often takes much time and efforts for them to cope with the change of the system management. This is because the requirements for the respective computer usage are different in the network and security policies. In this paper, destination addressing control system scheme (DACS Scheme) for the university network services is shown. The DACS Scheme performs network management efficiently through the communication management of a client. As the characteristic of DACS Scheme, only the setup modification is required by a system administrator, when configuration change of the network system is performed. Then, the setup modification is unnecessary by a customer, which shows a merit for both a system administrator and a customer. However, there is a problem to be solved. In existing DACS Scheme, it is promised that, DACS Client for controlling the communication must be implemented on all clients. When the client not installing DACS Client is connected to the network, each network server can be accessed from the client. Therefore, in this paper, secure DACS Scheme with function to prevent the communication from the client not installing DACS Client, is proposed and examined.
Modeling and Performance Evaluation of Hybrid Storage I/O in Data Grid
Authors: Zhaobin Liu, Haitao Li
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Storage I/O has become a performance bottleneck for many Data Grid applications. Characterization of I/O patterns has shown that many of these applications have complex, irregular I/O patterns. In this paper we show how Stochastic Petri Net (SPN) models can be exploited for performance analysis of hybrid I/O Data Grid storage systems. We study a typical storage system SPN modeling and simplify model complexities based on aggregate I/O. Evaluation using case studies shows that we can adjust the priority schedule by changing the ratio of file I/O and multimedia I/O.
Research On Cluster-Based Parallel GIS with the Example of Parallelization on GRASS GIS
Authors: Fang Huang, Dingsheng Liu, Peng Liu, Shaogang Wang, Yi Zeng, Guoqing Li, Wenyang Yu, Jian Wang, Lingjun Zhao, Lv Pang
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

With the increasing availability of large quantity of geospatial data, and the growing complexity of spatial algorithms, they are the most compelling challenges to the GIS computing efficiency. Faced the problems of computing and I/O intensive, it's an appropriate approach that involves the techniques such as distributed or parallel computing into GIS context. Some researches concerned into the parallelization algorithms for most all parts of GIS respectively, but few involved in the parallel architecture from integrating the specified overall GIS package into cluster. Fortunately, we discuss Multi-Uses Parallelization Model (MUPM) for GRASS GIS from making full use of its character of Multi-users, in which many GRASS users, located in different nodes, can work concurrently on subtasks. Under MUPM, the running function module maybe in sequential or parallel, i.e., most modules of GRASS can work in cluster with high performance without the need for redesigning and re-implementing existing algorithms. According to this, the framework, approach and key technologies etc. with Cluster-Based Parallel GIS are introduced. Finally, some tentative results are also available for illustration.
Automated energy calculation and estimation for delay-insensitive digital circuits
Authors: Venkat Satagopan, Bonita Bhaskaran, Anshul Singh, Scott C. Smith
Venue: Microelectronics Journal (2007)

With increasingly smaller feature sizes and higher on-chip densities, the power dissipation of VLSI systems has become a primary concern for designers. This paper first describes a procedure to simulate a transistor-level design using a VHDL testbench, and then presents a fast and efficient energy estimation approach for delay-insensitive (DI) systems, based on gate-level switching. Specifically, the VHDL testbench reads the transistor-level design's outputs and supplies the inputs accordingly, also allowing for automatic checking of functional correctness. This type of transistor-level simulation is absolutely necessary for asynchronous circuits because the inputs change relative to handshaking signals, which are not periodic, instead of changing relative to a periodic clock pulse, as do synchronous systems. The method further supports automated calculation of power and energy metrics. The energy estimation approach produces results three orders of magnitude faster than transistor-level simulation, and has been automated and works with standard industrial design tool suites, such as Mentor Graphics and Synopsys. Both methods are applied to the NULL Convention Logic (NCL) DI paradigm, and are first demonstrated using a simple NCL sequencer, and then tested on a number of different NCL 4-bitx4-bit unsigned multiplier architectures. Energy per operation is automatically calculated for both methods, using an exhaustive testbench to simulate all input combinations and to check for functional correctness. The results show that both methods produce the desired output for all circuits, and that the gate-level switching approach developed herein produces results more than 1000 times as fast as transistor-level simulation, that fall within the range obtained by two different industry-standard transistor-level simulators. Hence, the developed energy estimation method is extremely useful for quickly determining how architecture changes affect energy usage.
DHT overlay schemes for scalable p-range resource discovery
Authors: Liping Chen, K. S. Candan, J. Tatemura, D. Agrawal, D. Cavendish
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

The information service is a critical component of a grid infrastructure for resource discovery. Although P2P computing paradigm could address some of the scalability issues that plagued grid resource discovery, most existing distributed hash table (DHT) based P2P overlays have difficulty in treating attribute range queries that are common in resource discovery lookups due to the inherent randomness of hash functions. Recently, there have been various attempts to solve the range search problem over DHT networks [Aberer, et al. (2003), Gao and Steenkiste (2004), Ratnasamy, et al. (2003), and Tanin, et al. (2005)]. Central to all of these is a mapping scheme which maps the tree-structured logical index space to some DHT-based physical node space. In this paper, we propose a general framework to put all these under the same umbrella based on how mapping of the tree-structured index that identifies a physical node responsible of a particular range is done through replication. We identify three schemes which should cover the spectrum of all meaningful replication schemes: the tree replication scheme (TRS) replicates the entire tree; the path caching scheme (PCS) replicates paths from root to leaves; and the node replication scheme (NRS) replicates individual logical nodes.
Scan Power Reduction Through Scan Architecture Modification And Test Vector Reordering
Authors: Chandan Giri, Pradeep Kumar Choudhary, Santanu Chattopadhyay
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Due to higher switching activity within scan chain for scanning in/out of the stimuli/response pair, during testing average and peak power dissipation is much higher than the normal mode operation of a circuit. In our paper we propose a method of reducing dynamic power consumption in scan chain by introducing XOR gate at selected places in the traditional scan chain, there by converting the D flip-flops into T flip-flops temporarily during scan. This approach involves reordering of test vectors but not reordering of the scan cells. Our proposed method is verified with ISCAS89 benchmark circuits, which shows that upto 34% reduction in switching activity within modified scan architecture is possible.
Modular construction of complete coalgebraic logics
Authors: Corina Crstea, Dirk Pattinson
Venue: Theoretical Computer Science (2007)

We present a modular approach to defining logics for a wide variety of state-based systems. The systems are modelled as coalgebras, and we use modal logics to specify their observable properties. We show that the syntax, semantics and proof systems associated with such logics can all be derived in a modular fashion. Moreover, we show that the logics thus obtained inherit soundness, completeness and expressiveness properties from their building blocks. We apply these techniques to derive sound, complete and expressive logics for a wide variety of probabilistic systems, for which no complete axiomatisation has been obtained so far.
Bimanual task division preferences for volume selection
Authors: Amy Ulinski, Zachary Wartell, Larry F. Hodges
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Using both hands for 3D interaction allows users to transfer ingrained interaction skills, significantly increase performance on certain tasks, and reduce training [Bowman et al. 2005]. Guiard's framework of Bimanual manipulation states that different classes of bimanual actions exist [1997]. The Bimanual Asymmetric classification consists of both hands, performing different actions, coordinated to accomplish the same task. The Bimanual Symmetric classification involves each hand performing identical actions, either synchronously or asynchronously. Latulipe et al. compared a symmetric, dual-mouse technique for manipulation of spline curves, to two asymmetric dual-mouse techniques and a standard single-mouse technique. The symmetric technique performed best and was most preferred by participants [2006].
Reliability with Erlang
Authors: Steve Vinoski
Venue: IEEE Internet Computing (2007)

Born of the need to create highly reliable telecommunications systems, for which the maximum allowable downtime typically amounts to just a few minutes per year, including the time required for upgrades, Erlang is a powerful programming language. In this issue's Toward Integration column, Vinoski returns to examine it deeper to show those who develop enterprise-integration or middleware applications that require high reliability how Erlang handles the difficult parts of concurrency, distribution, and reliability with relative ease.
Entropy Rules for Vague Sets with Corresponding Entropy Measures
Authors: Li Yan-Hong, Li Si-Zhi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper provides two types of entropy rules for vague sets with corresponding entropy measures. These measures are compared with previously presented measures with examples. The performance of proposed measures are evaluated analytically. Through analysis and examples it is shown that the proposed approaches work well in determining the fuzziness of vague sets.
Ontology-Based Trajectory Analysis for Semantic Event Detection
Authors: Alexia Briassouli, Stamatia Dasiopoulou, Ioannis Kompatsiaris
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Semantic analysis of multimedia data, such as images, image databases and videos, has attracted much attention in the past years. The extraction of human centered descriptions, matching end users cognition, and specifically the detection and identification of events in videos is a particularly challenging problem, due to the volume and diversity of both the low-level features that can be extracted from multimedia data, and also of the corresponding high-level information conveyed. Numerous efforts have begun, attempting to bridge the semantic gap between low-level data and higher level descriptions, often resorting to domainspecific learning-based approaches. The advent, however of the Semantic Web paved a new direction in knowledge management and utilization, advancing aspects such as knowledge sharing and reuse. In this paper we present a novel, generally applicable approach, for hierarchical semantic analysis of spatiotemporal video features (trajectories) in order to localize and detect events of interest. Dynamically changing trajectories are extracted by processing the optical flow, based on its statistics. The temporal evolution of the trajectories' geometrical and spatiotemporal characteristics forms the basis on which event detection is performed. This is based on the exploitation of prior knowledge, which provides the formal conceptualization needed to enable the automatic inference of high level event descriptions. To enhance extensibility, a modular approach has been followed, employing different ontologies for the individual types of knowledge required, namely geometrical, spatiotemporal and domain related. Thus, knowledge and consequently derived descriptions, propagate along successively higher abstraction levels. Experimental results with a variety of surveillance videos are presented to exemplify the usability and effectiveness of the proposed system.
Extended abstract: requirements modeling within iterative, incremental processes
Authors: L. Pareto
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

Requirements modeling is an established method for detecting defects in requirement specifications. Although many companies have successfully incorporated requirements modeling in their software processes, other companies face technology adoption problems: methods appear incompatible with processes and technologies in use, and with the attitudes of engineers. We approach this problem by adaptation of standard modeling know-how to existing practices and attitudes in certain companies. By a requirements modeling process that respects the constraints of iterative, incremental, use case driven development, and that uses a modeling language with a low learning barrier (for engineers), we hope to make companies that use the unified process amenable to requirements modeling.
Application and Analysis of Time Domain Cross Correlation for Traffic Flow Speed Measurement
Authors: Lichao Wang, Qiyong Lu, Xi Chen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Radars are common means to measure vehicle speed. They are fast and accurate, however measure only instantaneous velocity not speed of the traffic flow. Therefore they are not suitable to help determine the busy degree of traffic. A novel method of traffic flow speed measurement using video based on time domain cross correlation is introduced. It provides "flow speed', a much better parameter determining whether there is a traffic jam or how fast one can cover that road under the observed situation. With regard to the "False-Peak' problem, effect of the sequence length on correlation result is presented, together with formulas used to calculate proper sequence length both accurately and approximately. Test results demonstrate the signification of sequence length on improving cross correlation result and good accuracy suitable for estimation of road busy degree.
Production Test of High Volume Commercial RFIC
Authors: Friedrich Taenzler
Venue: Proceedings of the 16th Asian Test Symposium (2007)

This presentation covers the motivations and constraints involved in multi-site testing of RF devices. A comprehensive list of these issues is documented in the following text.
Timing-Aware Decoupling Capacitance Allocation in Power Distribution Networks
Authors: Sanjay Pant, David Blaauw
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Power supply noise increases the circuit delay, which may lead to performance failure of a design. Decoupling capacitance (decap) addition is effective in reducing the power supply noise, thus making the supply network more robust in presence of large switching currents. Traditionally, decaps have been allocated in order to minimize the worst-case voltage drop occurring in the power grid. In this paper, we propose an approach for timing-aware decap allocation which uses global time slacks to drive the decap optimization. Non-critical gates with larger timing slacks can tolerate a relatively higher supply voltage drop as compared to the gates on the critical paths. The decap allocation is formulated as a non-linear optimization problem using Lagrangian relaxation, and modified adjoint method is used to efficiently obtain the sensitivities of objective function to decap sizes. A fast path-based heuristic is also implemented and compared with the global optimization formulation. The two approaches have been implemented and tested on ISCAS85 benchmark circuits and with grids of different sizes. Compared to uniformly allocated decaps, the proposed approach utilizes 35.5% less total decap to meet the same delay target. For the same total decap budget, the proposed approach is shown to improve the circuit delay by 10.1% on an average.
Design and implementation of a built-in camera based user interface for mobile games
Authors: Khoa Nguyen Tran, Zhiyong Huang
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

In this paper, we present a novel user interface design for mobile games using its built-in camera. It is motivated by the problem of limited number of keys on the small keypad of mobile devices. We implement two different ways, with and without the use of markers, to study the effectiveness of the design in a 2-dimensional and 3-dimensional game respectively. The algorithms implemented in the design are lightweight enough so that they are executable in real-time and at the same time, able to produce realism for the games.
The impact of various activity assumptions on the lead time and resource utilization of resource-constrained projects
Authors: Mario Vanhoucke, Dieter Debels
Venue: Computers and Industrial Engineering (2008)

The well-known resource-constrained project scheduling problem (RCPSP) schedules project activities within the precedence and renewable resource constraints while minimizing the total lead time of the project. The basic problem description assumes non-pre-emptive activities with fixed durations, and has been extended to various other assumptions in the literature. In this paper, we investigate the effect of three activity assumptions on the total lead time and the total resource utilization of a project. More precisely, we investigate the influence of variable activity durations under a fixed work content, the possibility of allowing activity pre-emption and the use of fast tracking to decrease a project's duration. We give an overview of the procedures developed in the literature and present some modifications to an existing solution approach to cope with our activity assumptions under study. We present computational results on a generated dataset and evaluate the impact of all assumptions on the quality of the schedule.
Development of Object-Oriented Modeling Tool for the Design of Industrial Control Logic
Authors: Kwan Hee Han, Jun Woo Park
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

As the level of automation increases, proper design of industrial control logic before the implementation of control logic is an imperative task for the successful operation of a AMS (Automated Manufacturing System). Whereas software engineering concept is mature in today's general information system developments, the systematic PLC program development methodology is not widely adopted on the shop floor. Proposed in this paper is a development of prototype modeling tool based on O-O modeling framework for industrial control logic. This prototype supports the systematic design procedure for reducing the logic errors before implementing the ladder logic, and enhances efficient communication among FA engineers who have different experiences and disciplines during the automation project. Besides logic design function, it provides the automation component library for standardized use of automation parts in the shop floor.
Diagnostic Rules Discovery with Hierarchical Clustering and Focusing Mechanism Based on Rough Sets Theory
Authors: Minghui Shi, Changle Zhou
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

An approach is proposed to discover diagnostic rules from clinical databases. First, the diseases in the clinical database are clustered by their necessary characterization. Then focusing mechanism, which includes three processes: exclusion process, discrimination process and combining process, is exploited to derive diagnostic rules. The main characteristic feature of the approach is: 1) coverage is exploited to find necessary characterization of diseases during the exclusion process, while accuracy is exploited to find A -sufficient characterization of diseases during the discrimination process; 2) discrimination process can be executed among many diseases; 3) a series of classification information systems (CISs) derived by exclusion process from the original are considered; 4) the CISs are reducted to the simple ones; 5) crisp rules and uncertain rules can be conveniently derived. Finally, an example illustrates the approach and shows its effectiveness.
Posets, clique graphs and their homotopy type
Authors: F. Larrión, M. A. Pizaña, R. Villarroel-Flores
Venue: European Journal of Combinatorics (2008)

To any finite poset P we associate two graphs which we denote by @W(P) and @?(P). Several standard constructions can be seen as @W(P) or @?(P) for suitable posets P, including the comparability graph of a poset, the clique graph of a graph and the 1-skeleton of a simplicial complex. We interpret graphs and posets as simplicial complexes using complete subgraphs and chains as simplices. Then we study and compare the homotopy types of @W(P), @?(P) and P. As our main application we obtain a theorem, stronger than those previously known, giving sufficient conditions for a graph to be homotopy equivalent to its clique graph. We also introduce a new graph operator H that preserves clique-Hellyness and dismantlability and is such that H(G) is homotopy equivalent to both its clique graph and the graph G.
Research on the Evaluation of Enterprises Knowledge Chain Performance Based on D-S Theory
Authors: Yong Ding, Chang-yong Liang, Cui-qing Jiang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Evaluation of knowledge chain performance is very helpful for enterprises finding out the key factors that restrain the enhancing of performance, and taking effective measures to improve their innovation ability. This paper, which covers from creating customer value, knowledge acquisition, knowledge sharing and transmission, knowledge innovation, to knowledge stocks and knowledge management platform, analyses the main factors of knowledge chain performance and establishes an indicator system about knowledge chain performance. Based on the system, an evidential reasoning method to evaluate knowledge chain performance is proposed and arithmetic steps for evidential reasoning are presented. At the last part of the paper, an example is given to illustrate that this method is effective and practicable.