ppxscal/embedding_network huggingface dataset:
Stable and efficient miscible liquid-liquid interactions
Authors: Hongbin Zhu, Kai Bao, Enhua Wu, Xuehui Liu
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

In our surrounding environment, we may often see many various miscible liquid-liquid mixture phenomena, like pouring honey or ink into water, Coca Cola into strong wine etc., while few papers have devoted to the simulation of the phenomena. In this paper, we use a two-fluid lattice Boltzmann method (TFLBM) to simulate the underlying dynamics of miscible mixtures. By the method, a subgrid model is applied to improve its numerical stability so that the free surface of the mixture, accompanying with higher Reynolds number, can be simulated. We also apply control forces to the mixture with interesting animation created. By optimizing the memory structure and taking the advantage of dual-core or multi-core systems, we achieve real time computation for a domain in 643 cells full of fluid mixtures.
Nighthawk: a two-level genetic-random unit test data generator
Authors: James H. Andrews, Felix C. H. Li, Tim Menzies
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Randomized testing has been shown to be an effective method fortesting software units. However, the thoroughness of randomized unit testing varies widely according to the settings of certain parameters, such as the relative frequencies with which methods are called. In this paper, we describe a system which uses agenetic algorithm to find parameters for randomized unit testing that optimize test coverage. We compare our coverage results to previous work, and report on case studies and experiments on system options
Isolation Method in a Network of Queues
Authors: J. Labetoulle
Venue: IEEE Transactions on Software Engineering (1980)

In this paper a new method for analyzing complex queueing networks is proposed: the isolation method. As an example, we study packet switching networks with finite buffer size at each node.
Some Stability Measures for Software Maintenance
Authors: S. S. Yau
Venue: IEEE Transactions on Software Engineering (1980)

Software maintenance is the dominant factor contributing to the high cost of software. In this paper, the software maintenance process and the important software quality attributes that affect the maintenance effort are discussed. One of the most important quality attributes of software maintainability is the stability of a program, which indicates the resistance to the potential ripple effect that the program would have when it is modified. Measures for estimating the stability of a program and the modules of which the program is composed are presented, and an algorithm for computing these stability measures is given. An algorithm for normalizing these measures is also given. Applications of these measures during the maintenance phase are discussed along with an example. An indirect validation of these stability measures is also given. Future research efforts involving application of these measures during the design phase, program restructuring based on these measures, and the development of an overall maintainability measure are also discussed.
Special Feature: An Automated Chinese Telephone Directory
Authors: Y. H. Chin
Venue: Computer (1975)

A real-time, on-line information storage and retrieval system for telephone information service has been designed at the Telecommunication Laboratories of Taiwan. The input and output of the system are processed in Chinese via a keyboard and a graphic display unit respectively. System functions include sorting, merging, updating, displaying, and printing of data.
Simulation and fabrication of high voltage AlGaN/GaN based Schottky diodes with field plate edge termination
Authors: K. Remashan, Wen-Pin Huang, Jen-Inn Chyi
Venue: Microelectronic Engineering (2007)

In this paper, we report the breakdown voltage (BV) of AlGaN/GaN based Schottky diodes with field plate edge termination. Simulation and fabrication of AlGaN/GaN Schottky diodes were carried out. The simulations were performed using the commercial 2-D device simulator DESSIS. From the simulations, it is found that for a given gate-Ohmic distance (L"g"d) of 10@mm, 2DEG of 1x10^1^3cm^-^2 and field plate length (L"F"P) of 2.5@mm, highest BV can be obtained for a silicon nitride thickness of 8000A and this BV value is more than 5 times that for a Schottky diode without field plate. The breakdown voltages were also simulated for different field plate lengths. The BV values obtained on the fabricated Schottky diodes are compared with the simulation data and the experimental results follow the trend obtained from the simulation. Simulations were also carried out on a Schottky diode with field plate placed over a stepped insulator with L"g"d=10@mm, L"F"P=5@mm and 2DEG=1x10^1^3cm^-^2 and the obtained BV values are about 7 times that without field plate.
On the counting function of the lattice profile of periodic sequences
Authors: Fang-Wei Fu, Harald Niederreiter
Venue: Journal of Complexity (2007)

The lattice profile analyzes the intrinsic structure of pseudorandom number sequences with applications in Monte Carlo methods and cryptology. In this paper, using the discrete Fourier transform for periodic sequences and the relation between the lattice profile and the linear complexity, we give general formulas for the expected value, variance, and counting function of the lattice profile of periodic sequences with fixed period. Moreover, we determine in a more explicit form the expected value, variance, and counting function of the lattice profile of periodic sequences for special values of the period.
Design of Experiments within the Mobius Modeling Environment
Authors: Tod Courtney, Shravan Gaonkar, Michael G. McQuinn, Eric Rozier, William H. Sanders, Patrick Webster
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

Models of complex systems often contain model parameters for important rates, probabilities, and initial state values. By varying the parameter values, the system modeler can study the behavior of the system under a wide range of system and environmental assumptions. However, exhaustive exploration of the parameter space of a large model is computationally expensive. Design of experiments techniques provide information about the degree of sensitivity of output variables to various input parameters. Design of experiments makes it possible to find parameter values that optimize measured outputs of the system by running fewer experiments than required by less rigorous techniques. This paper describes the design of experiments techniques that have been integrated in the M¨obius tool.
Improving Model-Checkers for Software Testing
Authors: Gordon Fraser, Franz Wotawa
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

In recent years, automated test-case generation with model-checkers has seen increasing attention in the re- search community. The use of model-checkers for testing offers full automation, a choice of different methods to de- rive test-suites, and is efficient under certain preconditions. Model-checkers, however, were not originally intended for this task. Therefore, there are several drawbacks that a tester has to cope with. If model-checkers were designed or adapted to take into account the needs that result from the application to software testing, this could lead to sig- nificant improvements with regard to test-suite quality and performance. In this paper, we discuss the drawbacks of current model-checkers when used for testing, and suggest ten ways in which model-checkers could be enhanced to be better suited for the task of test-case generation.
Accurate Chinese Text Classification via Multiple Strategies
Authors: Xiulan Hao, Chenghong Zhang, Xiaopeng Tao, Shuyun Wang, and Yunfa Hu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Text classification is one of means to understand text content. It is widely used in information retrieving, fil- tering spam, monitoring ill gossips, and blocking porno- graphic and evil messages. kNN is widely used in text categorization, but it suffers from biased training data set. In developing Prototype of Internet Information Security for Shanghai Council of Information and Security, we de- tect that when training data set is biased, almost all test documents of some rare (smaller) categories are classi- fied into common (larger) ones by traditional kNN clas- sifier. The performance of text classification can not sat- isfy the user's requirement in this case. To alleviate such a misfortune, we adopt 2 measures to boost kNN classi- fier. Firstly, we optimize features by removing some can- didate features. Secondly, we modify traditional decision rules by integrating number of training samples of each category with them. Exhaustive experiments illustrate that the adapted kNN achieves significant classification perfor- mance improvement on biased corpora.
Vanishing Point Detection in Complex Man-made Worlds
Authors: Horst Wildenauer, Markus Vincze
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper, we describe the components of a robust algorithm for the detection of vanishing points in man-made environments. We designed our approach to work under quite general conditions (e.g., uncalibrated camera); and in contrast to several other approaches, the assumption of a dominant line-alignment w.r.t. the orthogonal axes of the world coordinate frame (Manhattan world) is not explicitly exploited. Our only premise is, that if a significant number of the imaged line segments meet very accurately in a point, this point is very likely to be a good candidate for a real vanishing point. For finding such points under a wide range of conditions, we propose a flexible algorithmic pipeline that combines accurate line detection techniques with robust statistical candidate initialization and refinement stages. The method was evaluated on a set of images exhibiting largely varying characteristics concerning image quality and scene complexity. Experiments show that the method, despite the variations, works in a stable manner and that its performance compares favorably with the state of the art.
On The Effects of Sampling Rate and Interpolation in HMM-Based Dynamic Signature Verification
Authors: M. Martinez-Diaz, J. Fierrez, M. Freire, J. Ortega-Garcia
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this work, resampling techniques and interpolation are applied to on-line signatures. Their effect on the perfor- mance of an on-line signature system using Hidden Markov Models is studied. The presented techniques are based on linear interpolation and Catmull-Rom cubic splines. Exper- imental results are provided on the MCYT database com- prising 16,500 signatures from 330 subjects and as many skilled forgeries. Our approach allows to reduce the sam- pling rate of the on-line signature capture system, leading to the reduction of storage resource requirements and in- creased simplicity without compromising and even enhanc- ing the system performance. This also leads to the discus- sion of which is the minimum sampling rate for HMM-based dynamic signature verification.
Combining On-Line and Off-Line Systems for Handwriting Recognition
Authors: M. Liwicki, H. Bunke
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper we present a new multiple classifier system (MCS) for recognizing notes written on a whiteboard. This MCS combines one off-line and two on-line handwriting recognition systems derived from previous work. The rec- ognizers are all based on Hidden Markov Models but vary in the way of preprocessing and normalization. To combine the output sequences of the recognizers, we incrementally align the word sequences using a standard string matching algorithm. For deriving the final decision a voting strat- egy is applied. With the combination we could increase the system performance over the best individual recognizer by about 2%.
Performance and power evaluation of a 3D CMOS/nanomaterial reconfigurable architecture
Authors: Chen Dong, Deming Chen, Sansiri Tanachutiwat, Wei Wang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In this paper, we introduce a novel reconfigurable architecture, named 3D nFPGA, which utilizes 3D integration techniques and new nanoscale materials synergistically. The proposed architecture is based on CMOS-nano hybrid techniques that incorporate nanomaterials such as carbon nanotube bundles and nanowire crossbars into CMOS fabrication process. Using unique features of FPGAs and a novel 3D stacking method enabled by the application of nanomaterials, 3D nFPGA obtains a 4.5X footprint reduction compared to traditional CMOS-based 2D FPGAs. With a customized design automation flow, we evaluate the performance and power of 3D nFPGA driven by the 20 largest MCNC benchmarks. Results demonstrate that 3D nFPGA is able to provide a performance gain of 2.6X with a small power overhead comparing to the CMOS 2D FPGA architecture.
A formal approach to system level design: metamodels and unified design environments
Authors: F. Balarin, R. Passerone
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

The debate about efficient methods for hardware-software co-design has taken interesting turns over the years. In this paper, we argue that the essential problems to solve are prior to the decision on how to partition the system in hardware-software. We present a formal platform-based design method we have proposed over the years and a design environment, Metropolis, supporting the methodology, which starts by capturing the design specifications at the highest level of abstraction and then proceed toward an efficient implementation by subsequent refinement steps. We present the modeling strategy used in Metropolis based on formal semantics that is general enough to support the models of computation proposed so far and that facilitates the creation of new ones. Nonfunctional and declarative constraints can also be captured using a logic language.
Analysis of Closed Queuing Networks with Periodic Servers
Authors: G. H. Gonnet
Venue: IEEE Transactions on Software Engineering (1979)

A periodic network is a queuing network whose steady-state behavior is not constant in time, but repeats itself in a cycle. This behavior may be caused by the introduction of periodic servers, e.g., paging drums. The model presented is a generalization of some other models of queuing networks, and provides a more general definition of steady-state behavior. A theoretical solution is presented. Examples of theoretical and approximate solutions are presented for a well-known queuing network model of a computer system.
A Hybrid Optimization Method Based on Cellular Automata and its Application in Soft-Sensing Modeling
Authors: Yufa Xu, Guochu Chen, Jinshou Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

By studying cellular automata, a new optimization method based on cellular automata is proposed by this paper. The new optimization method assumes that "life game" are applied in operator of genetic algorithm (GA). Experiment results show that the new method has good optimization performance. Then, a hybrid neural network algorithm based on life game, GA and back-propagation algorithm is presented to train soft-sensing model of acrylonitrile yield. Experiment results show that the hybrid soft sensing model proposed in this paper has good performance and high measuring precision.
Integrated Agent and Semantic P2P Grid Resource Discovery Model
Authors: Zenggang Xiong, Yang Yang, Xuemin Zhang, Dairong Yu, Li Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Resource discovery is the key requirements in large heterogeneous Grid environments, and an effective and efficient resource discovery mechanism is crucial. However, the complicated and dynamic characteristics of grid resources make sharing and discovering them a challenge. In this paper, a novel model, in which agent and semantic are integrated, is proposed to discovery grid resource efficiently in P2P Grid environment. Resource discovery consists of two aspects: intra- GridPeer query and inter-GridPeer query. The semantic-based match is also used to increase the match accuracy and offers the intelligent search. The Model can adapt to the complex, heterogeneous and dynamic resources of the P2P Grid, and has a better scalability.
An Extension of Threshold Logic
Authors: T. A. Slivinski
Venue: IEEE Transactions on Computers (1970)

This paper presents an extension of the concept of linear separation to generate a wider class of Boolean functions. This generalization is affected by modifying the requirements for separation to allow both true and false assignments to reside on the same hyperplane (pseudoseparation) or within the same neighborhood of a hyperplane (marginal separation). Boolean functions which can be separated in either of these ways are called partially separable functions. This paper is divided into two parts. The first deals with pseudoseparable functions and the second deals with marginally separable functions. Some of the theoretical algebraic properties of partially separable functions are investigated, and the relationship between these and the corresponding properties for separable functions is explored. Necessary and sufflcient conditions for each type of separation are also discussed, A parameter which shows whether a given Boolean function is separable, pseudoseparable, or marginally separable is introduced.
Getting Real in the Classroom
Authors: Michiel van Genuchten, Doug Vogel
Venue: Computer (2007)

Exposing students to real-world projects will encourage them to share, learn, and improve.
An Experimental Study on Feature Subset Selection Methods
Authors: Chulmin Yun, Donghyuk Shin, Hyunsung Jo, Jihoon Yang, Saejoon Kim
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In the field of machine learning and pattern recognition, feature subset selection is an important area, where many approaches have been proposed. In this paper, we choose some feature selection algorithms and analyze their performance using various datasets from public domain. We measured the number of reduced features and the improvement of learning performance with chosen feature selection methods, then evaluated and compared each method on the basis of these measurements.
Rigorous Vertical Software System Testing In IDE
Authors: Kwang Ik Seo, Eun Man Choi
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

As the size of software is getting huge, a cost for development is also increasing in a test stage as well as a development stage. To reduce the increasing cost, we need various engineering approaches in every development stage of software development life cycle. This paper researches a vertical test method which connects a system test level and a integration test level in a test stage by using UML. We study traceability between system test cases, integration test cases, and source code and a method to curtail expenses during communications between developers and test engineers.
Multiresolution Model for Image Denoising Based on Total Least Squares
Authors: Chenglin Wen, Guowei Gao, Zhiguo Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

In this paper, we propose a novel method for removing noise from images corrupted with mixed noise, which is based on total least square algorithm. The method of multiresolution was applied to our arithmetic with more concentrational strategy, which has improved the efficiency of denoised arithmetic for TLS image as well as shortened the runtime, while ensuring the quality of denosing, especially the point,line,and edge regions. The simulation demonstrates that our algorithm proposed has a better denoised effect compared with other traditional denoising technique.
Compatibility and reuse in component-based systems via type and unit inference
Authors: Christian Kuhnel, Andreas Bauer, Michael Tautschnig
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

In many branches of industry, the component-based approach to systems design is predominant, e. g., as in embedded control systems which are often modelled using MATLAB/ Simulink. In order to facilitate reuse, and to raise the level of abstraction for future designs and frequently used functions, the employed tool sets offer built-in mechanisms to create sophisticated component libraries. For large, real-world designs, however, it is not always clear, whether or not a certain context violates even the most basic design assumptions of employed library components, thus often leading to expensive runtime errors. This paper introduces a practical method for checking compatibility of large designs, statically. This method not only ensures that large component-based designs provide a context such that all (library) components have well defined types, but it also ensures that transmitted physical units, such as m2, km/h, mph, etc. are preserved during computation. As such the possibility for runtime errors is reduced, and a metric for sound component reuse given.
A high-density earthquake monitoring system using wireless sensor networks
Authors: Makoto Suzuki, Shunsuke Saruwatari, Narito Kurata, Hiroyuki Morikawa
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

In this paper we present a high-density earthquake monitoring system using wireless sensor networks. For high-precision monitoring, we developed Pavenet OS, which is a hard-realtime operating system for sensor nodes, and acceleration sensor board. Sensor nodes of the system sample acceleration with less than 0.3 us jitter with Pavenet OS. The system provides earthquake engineering researchers the ability to measure vibrations of structures during earthquakes at less cost and higher node density than previous systems.
Small Scale Computing
Authors: D. R. Allison
Venue: Computer (1977)

The advent of the inexpensive LSI microprocessor and inexpensive memory has upset many of our cherished assumptions about economies of scale. The spectrum of plausible realities must now include computer systems which are essentially one user on one machine. In current parlance these are "small-scale systems," but they are small only in relative cost and physical size. Today's small-scale system can handle most computing problems. This issue of Computer attempts to address the phenomenon of the small-scale user - a phenomenon that will probably change the character of the entire computer industry.