ppxscal/embedding_network huggingface dataset:
Application Research on MTC Technology in Casting Based on FEM Simulation
Authors: D. D. You, M. Shao
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Application research on Mold Temperature Control (MTC) technology in casting was done based on Finite Element Method (FEM). A MTC forming process is presented here. The mathematical models of numerical computation are established, including heat transfer differential equation and its equivalent integral formulae and FEM combined equations, boundary conditions, processing method of MTC units. The numerical computational software was developed to implement the numerical model, and a control algorithm which is closer to the real process since the MTC units can be automatic controlled in it was presented. The 3D transient heat transfer analyses of three MTC cases were done using the developed software. The computational results indicate that in the second case, the solid-liquid interface keeps near-planar, and the growth velocity of the solid-liquid interface is greater than the first case, performing better than the others. Additionally, the relative errors between the numerical and experimental data are less than 8 percent. Thereby, the MTC technology is propitious to improve the forming quality and efficiency.
Embedding verifiable information flow analysis
Authors: Dorina Ghindici, Gilles Grimaud, Isabelle Simplot-Ryl
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

Pervasive computing is the next generation of computing environments. As a result more and more applications are dynamically deployed on a growing set of small safe devices. Applications delivered by different vendors may share code and data while they may not trust one another. We present an information flow analysis for full Java bytecode adapted for applications dedicated to embedded systems. Existing techniques are not well adapted to this domain and are often too complex. To ease embedded operations and reduce overhead, an external static analysis is performed initially, and the results are embedded as annotations within the code and certified at loading time. In contrast with other analysis techniques, our model supports dynamic class loading. We evaluated our model on a business case study involving an electronic wallet for air miles storage and management from the literature. We obtained the same results as the other papers but under more restrictive conditions related to inherent characteristics of embedded environments.
Tools for planning and designing data communications networks
Authors: Aaron Kershenbaum
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The planning, design, and management of a large telecommunications network is a complex process involving many aspects of the network's cost and performance. Throughput capability, reliability, response time performance, and cost must all be considered in evaluating alternatives. For a large network, obtaining an accurate analysis of any one of these aspects is a formidable task involving cumbersome calculation and many decisions. The problem of obtaining an accurate analysis of the entire system is magnified by the fact that these individual factors interact strongly with one another. Thus, in order to design a "good" network, or verify that an existing network is operating properly, one must not only be able to solve each of the above problems, but also be able to evaluate the solution of each one in the context of solutions to the others.
Annotate once, appear anywhere: collective foraging for snippets of interest using paragraph fingerprinting
Authors: Lichan Hong, Ed H. Chi
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

A common practice in work groups is to share links to interesting web pages. Moreover, passages in these web pages are often cut-and-pasted, and used in various other contexts. In this paper we report how we explore the idea of paragraph fingerprinting to achieve the goal of annotate once, appear anywhere"in a social annotation system called SparTag.us. This work was motivated by the prominence of redundant contents with different URLs on the Web and shared documents that are read and re-read within enterprises. Our technique attaches users' annotations to the contents of paragraphs, enabling annotations to move along with the paragraphs within dynamic live pages and travel across page boundary to other pages as long as the paragraph contents remain intact. We also describe how we use paragraph fingerprinting to facilitate the social sharing of information nuggets among our users.
Natural human role in supervising complex control systems
Authors: Henry Hexmoor, Brian McLaughlan, Gaurav Tuli
Venue: Journal of Experimental Theoretical Artificial Intelligence (2009)

Large collections of communities such as those found in complex control systems necessitate sophisticated techniques for high-level human supervision due to their requirements of influence spanning over individuals, communities, and global system behaviours. We have developed psycho-socio-cultural models for mediation of system-level behaviours and interactions. The ensuing lowered human cognitive load will enable supervisors to effectively guide large systems with competing objectives. This model paves the way for developing the 'Man On The Loop' (MOTL) paradigm, a phrase we are proposing for a novel human supervision role that contrasts with typical micromanagement. We have highlighted and validated MOTL parameters through the implementation of a domain-neutral simulation and compared our results with those found in natural systems.
Damping of power system oscillation by PSS using GA
Authors: Saeid Kyanzadeh, Malihe M. Farsangi, Hossein Nezamabadi-pour
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

Among stability issues, the damping of electromechanical oscillations has been recognized as an important issue in electrical power system operation. This paper investigates the ability of Genetic Algorithm (GA) to design power system stabilizer (PSS) to damp the inter area oscillation. For this the parameter of the PSS are determined by GA using a phased-based objective function. The numerical results are presented on a 2- area 4-machine system to illustrate the feasibility of the proposed method by GA using a phased-based objective function.
Towards identification of Wiener systems with the least amount of a priori information: IIR cases
Authors: Er-Wei Bai, John Reyland,  Jr.
Venue: Automatica (Journal of IFAC) (2009)

In this paper, we investigate what constitutes the least amount of a priori information on the nonlinearity so that the linear part is identifiable in the non-Gaussian input case. Under the white noise input, three types of a priori information are considered: quadrant information, point information, and monotonic information. In all three cases, identifiability has been established, and the corresponding nonparametric identification algorithms are developed along with their convergence proofs.
Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
Authors: Jan Stöcker, Frédéric Lang, Hubert Garavel
Venue: Proceedings of the 7th International Conference on Integrated Formal Methods (2009)

To model real-life critical systems, one needs"high-level" languages to express three important concepts: complex data structures, concurrency, and real-time. So far, the verification of timed systems has been successfully applied to "low-level" models, such as timed extensions of automata or of Petri nets. To bridge the gap between high-level languages, which allow a concise modeling of systems, and low-level models, for which efficient algorithms and tools have been designed, intermediate models are needed. In this paper, we propose the Atlantif intermediate model, an extension with real-time and concurrency of the Ntif (New Technology Intermediate Format) intermediate model. We define the formal semantics of Atlantif and present a translator from Atlantif to timed automata (for verification using Uppaal), and to time Petri nets (for verification using Tina).
Cotton Variety Selection Model and Application Design
Authors: Yang Yu, Yan Zhang
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

Choosing a cotton variety involves making comparisons over many trials and across an increasingly large number of available varieties. To aid in this process, a computerized tool has been developed at the Texas Tech University. This tool, called COTWIZ, based on the cotton variety selection model, allows multiple comparisons of varieties across a number of trial locations. COTWIZ based on the cotton variety selection model and uses cotton OVT data to make comparisons that are imported by the user.
Simulation as an integral part of the decision making processes in a service industry: eircom's field technicians
Authors: Feargal Timon
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Eircom is Irelands main supplier of Telecommunication networks. Fault arrival in these networks is unpredictable, however the pattern of fault arrivals is predictable. A key decision involves the planning of staff levels in order to meet potential peak demand (which can be excessive); as planning to meet average demand leads to very poor service levels. The model is used find an agreed balance between Service Level and "Productivity". The model also provides a collaborative and transparent decision making methodology for Eircom. The main groups involved are customer service, field management, and the field workforce. The model helps in analysing these conflicting requirements and bringing the three groups together to reach a decision. The Model is used to plan staffing levels. 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
Study on Confirming Increasable Bottleneck Device in Complex Product Dynamic Scheduling
Authors: Zhiqiang Xie, Yong Liu, Shuzhen Hao, Guangyu Tan, Fengru Wang
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Aiming at the problem that the machine is single and some machine has effect on the processing efficiency in complex product dynamic scheduling, based on the conceptions of bottleneck device classification and increasable bottleneck device, an algorithm which can confirm the increasable bottleneck device is put forward by calculating the total time of parallel operations and by analyzing the number of immediate predecessors. Calculating the total time of parallel operations for a device can confirm the shrinkable times of increasing this device. When devices have the same total time of parallel operations, choosing the device which has the most number of immediate predecessors can make more operations be processed as soon as possible. The verification and comparison of example show that the aim of improving the production efficiency is achieved by adding the increasable bottleneck device. The algorithm is simple and it can confirm the increasable bottleneck device quickly in complex product dynamic scheduling.
Combining Language Modeling and Discriminative Classification for Word Segmentation
Authors: Dekang Lin
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

Generative language modeling and discriminative classification are two main techniques for Chinese word segmentation. Most previous methods have adopted one of the techniques. We present a hybrid model that combines the disambiguation power of language modeling and the ability of discriminative classifiers to deal with out-of-vocabulary words. We show that the combined model achieves 9% error reduction over the discriminative classifier alone.
Reliable guaranteed cost control for uncertain switched non-linear systems
Authors: Rui Wang, Jun Zhao
Venue: International Journal of Systems Science (2009)

The problem of the reliable guaranteed cost control for uncertain switched non-linear systems that may have actuator failures is studied in this article. In contrast to previous works on this problem, the basic assumption that actuators which never fail must stabilise the system is not needed for the present theoretic result. Thus, the method of guaranteed cost control is further extended. On the grounds of the switching control approach, a sufficient condition for the existence of the hybrid state feedback reliable guaranteed cost controller is derived by means of multiple-Lyapunov function technique. Finally, an elaborated illustrative example demonstrates the effectiveness of the proposed extension of the guaranteed cost control method.
3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge
Authors: Giovanni Crescenzo, Helger Lipmaa
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Under sub-exponential time hardness assumptions, we show that any language in NP has a 3-message argument system in the bare public key (BPK) model, that satisfies resettable zero-knowledge (i.e., it reveals no information to any cheating verifier that can even reset provers) and bounded-resettable soundness (i.e., a verifier cannot be convinced of a false theorem, even if the cheating prover resets the verifier up to a fixed polynomial number of sessions). Our protocol has essentially optimal soundness among 3-message protocols (in that all stronger known soundness notions cannot be achieved with only 3 messages) and zero-knowledge (in that it achieves the strongest known zero-knowledge notion). We also show an extension of this protocol so that it achieves polylogarithmic communication complexity, although under very strong assumptions.
The Decision-Making Analysis of Adoption Subjects of Financial Innovation
Authors: Wuwei Li, Shuzhen Zhu, Mingli Zhong
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper analyses that the micro decision-making behaviors of the adoption subjects of financial innovation activities, it demonstrates that the decision-making behaviors are the investment problems under conditions of uncertainty to a large extent, and the subjects has the right to delay investment. The paper adopted a monopolistic real option model to describe the basic decision-making behaviors of innovation individuals facing innovation opportunities. Compared with the traditional net present value (NPV) rules, the authors conclude that the value of the investment opportunities that be calculated by real option method give full consideration to the volatility in the future and the corresponding changes of decision-making, and it provides a more objective and reasonable theoretical basis for investment decision-making of financial innovation activities.
Computational algorithms for computing the fractional derivatives of functions
Authors: Zaid M. Odibat
Venue: Mathematics and Computers in Simulation (2009)

In this paper, we propose algorithms to compute the fractional derivatives of a function by a weighted sum of function values at specified points. The fractional derivatives are considered in the Caputo sense. The error analysis of the algorithms and some illustrative examples are presented. The numerical results confirm that the new algorithms are accurate, efficient and readily implemented.
A Unified Structure-Based Framework for Indexing and Gisting of Meetings
Authors: T. Kristjansson, T. S. Huang, P. Ramesh, B. H. Juang
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

A variety of media involve the spoken interaction of people. For this media to be useful, indexing and browsing facilities must be provided to the user. In this paper we present a unified framework for indexing and gisting spoken interactions of people. We use speaker identification, prosody analysis and word spotting as preprocessing steps to find the structure of the meeting. The structure is modeled using a stochastic approach based on the Hidden Markov Model. The result of the analysis is an outline or table of content, as well as a rich set of visual queues for navigating the media. In addition to the automatic analysis, we provide the user with tools for browsing the meeting, as well as tools for directing the analysis and editing the results. We present early results using the proposed framework.
Independence of vectors in codes over rings
Authors: Steven T. Dougherty, Hongwei Liu
Venue: Designs, Codes and Cryptography (2009)

We study codes over Frobenius rings. We describe Frobenius rings via an isomorphism to the product of local Frobenius rings and use this decomposition to describe an analog of linear independence. Special attention is given to codes over principal ideal rings and a basis for codes over principal ideal rings is defined. We prove that a basis exists for any code over a principal ideal ring and that any two basis have the same number of vectors.
A 14-bit dual-path 2-0 MASH ADC with dual digital error correction
Authors: Zhenyong Zhang, Jesper Steensgaard, Gabor C. Temes, Jian-Yi Wu
Venue: Analog Integrated Circuits and Signal Processing (2009)

A dual-path 2-0 cascaded delta-sigma (MASH) ADC was implemented with fast digital correction of both DAC errors and MASH mismatch errors. The digital correction techniques greatly reduced the requirements on the analog circuits. The dual-path structure allows fast convergence and improved accuracy for the correction. Using a 20 MHz clock, the prototype chip achieved an 84 dB dynamic range in a 1.25 MHz signal band, when fabricated in CMOS 0.18 μm process.
ViewpointProgram committee overload in systems
Authors: Ken Birman, Fred B. Schneider
Venue: Communications of the ACM (2009)

Conference program committees must adapt their review and selection process dynamics in response to evolving research cultural changes and challenges.
Incremental buffer insertion and module resizing algorithm using geometric programming
Authors: Qing Dong, Bo Yang, Jing Li, Shigetoshi Nakatake
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

This paper presents an efficient algorithm for incremental buffer insertion and module resizing for a full-placed floorplan. Our algorithm offers a method to use the white space in a given floorplan to resize modules and insert buffers, and at the same time keep the resultant floorplan as close to the original one as possible. Both the buffer insertion and module resizing are modelled as geometric programming problems, and can be solved extremely efficiently using new developed solution methods. The experimental results suggest that the the wirelength difference between the initial floorplan and result is quite small (less than 5%), and the global structure of the initial floorplan is preserved very well.
Preconditioned Lanczos method for generalized Toeplitz eigenvalue problems
Authors: Yuan-Yuan Wang, Lin-Zhang Lu
Venue: Journal of Computational and Applied Mathematics (2009)

We employ the sine transform-based preconditioner to precondition the shifted Toeplitz matrix A"n-@rB"n involved in the Lanczos method to compute the minimum eigenvalue of the generalized symmetric Toeplitz eigenvalue problem A"nx=@lB"nx, where A"n and B"n are given matrices of suitable sizes. The sine transform-based preconditioner can improve the spectral distribution of the shifted Toeplitz matrix and, hence, can speed up the convergence rate of the preconditioned Lanczos method. The sine transform-based preconditioner can be implemented efficiently by the fast transform algorithm. A convergence analysis shows that the preconditioned Lanczos method converges sufficiently fast, and numerical results show that this method is highly effective for a large matrix.
An entropy-based algorithm for data elimination in time-driven software instrumentation
Authors: Ahmet Özmen
Venue: Journal of Systems and Software (2009)

While monitoring, instrumented long running parallel applications generate huge amount of instrumentation data. Processing and storing this data incurs overhead, and perturbs the execution. A technique that eliminates unnecessary instrumentation data and lowers the intrusion without loosing any performance information is valuable for tool developers. This paper presents a new algorithm for software instrumentation to measure the amount of information content of instrumentation data to be collected. The algorithm is based on entropy concept introduced in information theory, and it makes selective data collection for a time-driven software monitoring system possible.
Sketch and run: a stroke-based interface for home robots
Authors: Daisuke Sakamoto, Koichiro Honda, Masahiko Inami, Takeo Igarashi
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Numerous robots have been developed, and some of them are already being used in homes, institutions, and workplaces. Despite the development of useful robot functions, the focus so far has not been on user interfaces of robots. General users of robots find it hard to understand what the robots are doing and what kind of work they can do. This paper presents an interface for the commanding home robots by using stroke gestures on a computer screen. This interface allows the user to control robots and design their behaviors by sketching the robot's behaviors and actions on a top-down view from ceiling cameras. To convey a feeling of directly controlling the robots, our interface employs the live camera view. In this study, we focused on a house-cleaning task that is typical of home robots, and developed a sketch interface for designing behaviors of vacuuming robots.
Scalable Parallel 3d FFTs for Electronic Structure Codes
Authors: Andrew Canning
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

First-principles methods based on Density Functional Theory (DFT) where the wavefunctions are expanded in plane waves (Fourier components) are the most widely used approach for electronic structure calculations in materials science. The scaling of this method depends critically on having an efficient parallel 3d FFT that minimizes communications and calculations. We present an implementation and performance data of a parallel 3d FFT specifically designed for electronic structure calculations that scales to thousands of processors on leading parallel and vector computer platforms (IBM SP, Cray XT, NEC SX).
Research on GridFTP Traffic Features
Authors: Ming Yang, Yuanan Liu, Xiaolei Ma, Li Li, Peng Hu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

GridFTP is a secure and efficient data transfer protocol in Grid. This paper proposes a test scenario for the GridFTP traffic features. Firstly it gives a general description of the testbed traffic from the aspects of packet characteristics and throughput distribution; then analyses the self-similarity features of the GridFTP traffic and their decomposed data flows both in WAN and in LAN. Analysis results show that the parallel transfer of GridFTP increases both the self-similarity degree and the throughputs.