ppxscal/embedding_network huggingface dataset:
Voltage-island driven floorplanning considering level-shifter positions
Authors: Bei Yu, Sheqin Dong, Satoshi Goto, Song Chen
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Power optimization has become a significant issue when the CMOS technology entered the nanometer era. Multiple-Supply Voltage (MSV) is a popular and effective method for power reduction. Level shifters may cause area and Interconnect Length Overhead(ILO), and should be considered during floorplanning and post-floorplanning stages. In this paper, we propose a two phases framework VLSAF to solve voltage and level shifter assignment problem. At floorplanning phase, we use: a convex cost network flow algorithm to assign voltage; a minimum cost flow algorithm to assign level shifter. At post-floorplanning phase, a heuristic method is adopted to redistribute white spaces and calculate the positions and shapes of level shifters. Experimental results show VLSAF is effective.
Contradictory antecedent debugging in bounded model checking
Authors: Daniel Grosse, Robert Wille, Ulrich Kuehne, Rolf Drechsler
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

In the context of formal verification Bounded Model Checking (BMC) has shown to be very powerful for large industrial designs. BMC is used to check whether a circuit satisfies a temporal property or not. Typically, such a property is formulated as an implication. In the antecedent of the property the verification engineer specifies the assumptions about the design environment and joins the respective expressions by logical AND. However, the overall conjunction may have no solution, i.e. the antecedent is contradictory. Since in this case a property trivially holds this situation has to be avoided. Furthermore, the root cause of a contradictory antecedent has to be identified which is a manual and very time-consuming process. In this paper we propose a fully automatic approach for presenting all reasons of a contradictory antecedent to the verification engineer, i.e. the approach pinpoints to the sub-expressions in the antecedent that form a contradiction. Hence, our approach reduces the debugging time of a contradictory antecedent significantly.
Searching large indexes on tiny devices: optimizing binary search with character pinning
Authors: Guy Shani, Christopher Meek, Tim Paek, Bo Thiesson, Gina Danielle Venolia
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large online stores it becomes increasingly important to help the user select a particular item efficiently. Thus, we propose binary search with character pinning, where users can constrain their search to match selected prefix characters while making simple binary decisions about the position of their intended item in the lexicographic order. The underlying index for our method is based on a ternary search tree that is optimal under certain user-oriented constraints. To better scale to larger indexes, we analyze several heuristics that rapidly construct good trees. A user study demonstrates that our method helps users conduct rapid searches, using less keystrokes, compared to other methods.
Plenary lecture V: super-object-oriented programming and simulation
Authors: Eugene Kindler
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

One applies simulation namely in studying complex systems and for that purpose special programming techniques were developed, among which the object-oriented programming (OOP) passed the domain of simulation over and became a universal technique of programming and of representation of concepts. A man-made system S designed in a modern way often uses a computer C for controlling its operation and - in case the controlling is complex - it uses also simulation and/or OOP. If such a man-made system S is simulated during its design phase, C should be reflected in the used simulation model M, together with its operation, namely with the (simulation) model m and/or the represented concepts used by it; this statement can be exactly proved. So the "internal" model m should be "nested" in the "external" model M and often the system r of concepts represented for the purpose of m should be "nested" into the system R of concepts represented for the purpose of M. The psychology demands the authors of the models to introduce the same names of concepts, of functions and of elements for both the models M and m, although they essentially differ by their own relation to the simulated reality; for example, they have their own (mutually different) time flows; moreover, a danger of a fatal error called transplantation exists, consisting in assigning a name qualified in one of the models to an element belonging to the other one. There is a technique called super-object-oriented programming (SOOP) that allows secure and decipherable producing of such "nesting" models. It consists in enlarging the OOP by "life rules", i.e. algorithms according the instances of the concepts should behave, and local classes, that enable an instance E of a class to carry classes "nested" in it. In M, E can simply model a modeling/simulating computer (or even a formalized human "manager" existing inside the system reflected by M, who time to time anticipates possible future consequences of his own decisions). Surprisingly, SOOP was discovered already 41 years ago together with the OOP. The principles of solving obstacles in the nesting simulation models will be presented. The author led some works oriented to simulation of the sea harbors (especially container terminals), of the production halls equipped with auto-routed vehicles, and of the hospital sections, and in the Czech Republic and France such techniques were followed, namely in developing special "quasi-parallel" methods of optimizing and of nested simulation models of public transport, of circular conveyors and of systems of demographic development. Their details will be presented in special papers of their authors.
Representations of Evolutionary Electronics
Authors: Xuesong Yan, Pan Fang, Qingzhong Liang, Chenyu Hu
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

For the evolutionary algorithm, the representation of the electronic circuit has two methods, one kind is code with the electronic circuit solution space, the other is code with the problem space. How weighs one representation quality may think the following questions? The first is the code method should as far as possible complete, it is say for the significance solution circuit or the optimize solution obtains in the problem space may represented by this code method. The second is the code method should speeds up the convergence speed of the algorithm search. The hardware representation methods mainly include binary bit string representation, tree representation, Cartesian Genetic Programming representation and other representations. In this paper, we will introduce the representations of the binary bit string and Cartesian Genetic Programming in detail, then give some examples of the two representations.
Improving Trade-Offs in Bilateral Negotiations under Complete and Incomplete Information Settings
Authors: Ivan Marsa-Maestre, Miguel A. Lopez-Carmona, Juan R. Velasco
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

A bilateral negotiation may be seen as an interaction between two agents with the goal of reaching an agreement over a given range of issues which usually involves solving a conflict of interests between the agents. Usually, the agents taking part in the negotiation will consider different issues to be the most important ones for satisfying their goals, which allows to make issue trade-offs to search for joint gains. In particular, similarity criteria have been used to perform trade-offs in bilateral negotiations. This approach behaves differently depending on the knowledge each agent has about its counterpart, and depending on the order in which the different issues are considered. In this paper we propose two new approaches to improve the search for win-win solutions, one for complete information settings and the other for incomplete information settings. The experimental evaluation shows how our proposals improve the efficiency and optimality of the negotiation process over previous approaches.
Deterministic and unambiguous two-dimensional languages over one-letter alphabet
Authors: Marcella Anselmo, Maria Madonia
Venue: Theoretical Computer Science (2009)

The paper focuses on deterministic and unambiguous recognizable two-dimensional languages with particular attention to the case of a one-letter alphabet. The family DREC(1) of deterministic languages over a one-letter alphabet is characterized as both L(DOTA)(1), the class of languages accepted by deterministic on-line tessellation acceptors, and L(2AFA)(1), the class of languages recognized by 2-way alternating finite automata. We show that there are inherently ambiguous languages and unambiguously recognizable languages that cannot be deterministically recognized even in the case of a one-letter alphabet. In particular we show that on-line tessellation acceptors are more powerful than their deterministic counterpart, even in the case of a one-letter alphabet. Finally we show that DREC(1) is complex enough not to be characterized in terms of classical operations.
Scalable Security and Conditional Access Control for Multiple Regions of Interest in Scalable Video Coding
Authors: Yeongyun Kim, Sung Ho Jin, Yong Man Ro
Venue: Proceedings of the 6th International Workshop on Digital Watermarking (2008)

In this paper, we propose an encryption method to secure the multiple regions of interest (ROIs) of scalable video coding (SVC) bitstream from malicious attacks and a key generation scheme to control the protected ROIs conditionally. To establish the encryption method, we analyze the encryption requirements to maintain spatial, temporal, and SNR scalability of SVC. Depending on the given user's condition such as the status of the payment, the proposed conditional access control provides keys to access various types of the secured scalable videos ranging from the lowest to the highest quality. Since the conditional access control needs multiple ROIs as secured videos, the key generation scheme should support the multiple ROIs that are secured with the proposed encryption method. Experiments are performed to verify the proposed methods and results show that the proposed schemes could provide an effective access control of the secured multiple ROIs in SVC.
Breaking the memory secrecy assumption
Authors: Raoul Strackx, Yves Younan, Pieter Philippaerts, Frank Piessens, Sven Lachmund, Thomas Walter
Venue: Proceedings of the Second European Workshop on System Security (2009)

Many countermeasures exist that attempt to protect against buffer overflow attacks on applications written in C and C++. The most widely deployed countermeasures rely on artificially introducing randomness in the memory image of the application. StackGuard and similar systems, for instance, will insert a random value before the return address on the stack, and Address Space Layout Randomization (ASLR) will make the location of stack and/or heap less predictable for an attacker. A critical assumption in these probabilistic countermeasures is that attackers cannot read the contents of memory. In this paper we show that this assumption is not always justified. We identify a new class of vulnerabilities -- buffer overreads -- that occur in practice and that can be exploited to read parts of the memory contents of a process running a vulnerable application. We describe in detail how to exploit an application protected by both ASLR and stack canaries, if the application contains both a buffer overread and a buffer overflow vulnerability. We also provide a detailed discussion of how this vulnerability affects other, less widely deployed probabilistic countermeasures such as memory obfuscation and instruction set randomization.
Alignment of 3D models
Authors: Mohamed Chaouch, Anne Verroust-Blondet
Venue: Graphical Models (2009)

In this paper we present a new method for alignment of 3D models. This approach is based on two types of symmetries of the models: the reflective symmetry and the local translational symmetry along a direction. Inspired by the work on the principal component analysis (PCA), we select the best optimal alignment axes within the PCA-axes, the plane reflection symmetry being used as a selection criterion. This pre-processing transforms the alignment problem into an indexing scheme based on the number of the retained PCA-axes. In order to capture the local translational symmetry of a shape along a direction, we introduce a new measure we call the local translational invariance cost (LTIC). The mirror planes of a model are also used to reduce the number of candidate coordinate frames when looking for the one which corresponds to the user's perception. Experimental results show that the proposed method finds the rotation that best aligns a 3D mesh.
Application of High Precision Terrain Modeling Based on ArcGIS in Multigen Creator
Authors: Yong Chang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The simulation of high precision terrain model in virtual reality is very important in many application fields. At present, many terrain data sources such as CAD data and large scale topographic map can not be imported into Multigen Creator directly, and must be processed in GIS platform before being imported into Creator. This paper studies on construction and conversion of high precision terrain modeling from ArcGIS into Creator . At first, this paper discusses three kinds of terrain modeling which are DEM, TIN and TIN with compulsory constraints. Then, this paper takes 3D virtual road as an example, and introduces in detail the construction of high precision TIN model of Traveling Road in ArcGIS. The ArcGIS TIN is transformed into OpenFlight format. At last, this paper constructs the 3D road model and building model in Creator. After running in Vega.,the result proves the technical route of this paper reasonable and feasible.
A note on the non-negativity of continuous-time ARMA and GARCH processes
Authors: Henghsiu Tsai, Kung-Sik Chan
Venue: Statistics and Computing (2009)

A general approach for modeling the volatility process in continuous-time is based on the convolution of a kernel with a non-decreasing Lévy process, which is non-negative if the kernel is non-negative. Within the framework of Continuous-time Auto-Regressive Moving-Average (CARMA) processes, we derive a necessary condition for the kernel to be non-negative, and propose a numerical method for checking the non-negativity of a kernel function. These results can be lifted to solving a similar problem with another approach to modeling volatility via the COntinuous-time Generalized Auto-Regressive Conditional Heteroscedastic (COGARCH) processes.
A novel study of head motion hysteresis issues in contact probe recording systems
Authors: Narayanan Ramakrishnan, Mark D. Bedillion
Venue: Microsystem Technologies (2009)

Contact-based recording on ferroelectric media and polymer media have been proposed and investigated for high-density probe storage. To achieve fast data rate, it is necessary to perform reading or writing with multiple probe heads simultaneously. However, localized variations in tribological behavior at the contact interface between the probes and recording media and variation in normal contact force would result in variation in friction and stiction over the interface and therefore amongst individual heads in the probe head array. This causes variation in the hysteretic motion of the heads over the array, which in turn results in off-track motion during track-positioning and timing errors during scanning. In this paper a novel method of modeling these effects is developed to study the effect of relative head-motion hysteresis (RHMH) on timing-error during data read&#x2013;write and off-track errors during seek-settle. A mathematical model of RHMH during scanning along the bit-wise direction is developed based on the idea of stochastic averaging. A transient response model is similarly developed for estimating hysteresis effects during seek-settle. These models help to understand parametric dependencies of RHMH and can be used in designing the probe heads, the probe&#x2013;media interface (PMI) and the probe system in general. Further several schemes involving modulation of the normal force at the PMI are proposed to mitigate RHMH and their benefits are analyzed using the models described in this paper.
Beat Noise Analysis in Phase Encode Optical Code Division Multiple Access System Embedded Polarization
Authors: Hui Yan, Kun Qiu, Yun Ling
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In this paper, a phase-encoded optical code division multi-access (PE-OCDMA) system model is proposed. In order to analyze the impact of beat noise with precise, a Gaussian-approximation method by taking polarization into account is fist introduced in this paper. The bit error rate (BER) formula of Gold sequence is obtained, when all interference signals are paralleled with the targeted user we derived the upper bound of the BER, and derived the lower bound of BER when all interference signals are orthogonal with the targeted user. From the numerical results, we can conclude that the beat noise impact the BER performance dramatically. With the receiving optical power and the active user number increasing, the effect of polarization is remarkable.
Difficulties in establishing common ground in multiparty groups using machine translation
Authors: Naomi Yamashita, Rieko Inaba, Hideaki Kuzuoka, Toru Ishida
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

When people communicate in their native languages using machine translation, they face various problems in constructing common ground. This study investigates the difficulties of constructing common ground when multiparty groups (consisting of more than two language communities) communicate using machine translation. We compose triads whose members come from three different language communities--China, Korea, and Japan--and compare their referential communication under two conditions: in their shared second language (English) and in their native languages using machine translation. Consequently, our study suggests the importance of not only grounding between speaker and addressee but also grounding between addressees in constructing effective machine-translation-mediated communication. Furthermore, to successfully build common ground between addressees, it seems important for them to be able to monitor what is going on between a speaker and other addressees.
Development of a container terminal educational simulator
Authors: Hyun Soo Kim, Hyung Rim Choi, Jae Un Jung, Jae Young Park, Hui Yun Kim
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

In this paper, a study was conducted inquiring into the development of a simulator, which can be used as training material for the internal process of container terminal among various areas of habor distribution. For developing a simulator, a language called Powersim was used. It is a useful tool for causationally modelling the composition of a system. The advantage of designing the model of a container terminal by using the tool is that learners can causationally understand the internal process of the container terminal. On the other hand, the interface of the simulator has been designed as a form of digital dashboard, which faciliates the input and output of the senario (Value of environmental variables) so the learners can analyze the course of changes incurring during processing the traffic volume within the terminal depending on various technologies and how they are applied in the terminal. In the following studies, we are planning to develop a more dynamic training tool for operating container terminal by complementing the ommitted part of the simulation model developed up to the present and by concretly designing the parts that have been presented abstractly.
A Fully Automated Object Extraction from Video Stream: A Useful Tool for Distributed Object-Based Browsing and Content-Based Searching Systems
Authors: Atsunobu Hiraiwa, Keisuke Fuse, Naohisa Komatsu, Kazumi Komiya, Hiroaki Ikeda
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper proposes a new approach to automatically extract an accurate object from video streams. The new approach provides a useful tool for distributed object based browsing and content based searching systems, and consists of a skip-labeling algorithm for feature-based segmentation, an occlusion-killer algorithm for estimating accurately optical flow, and a shrink-merge tracking algorithm for tracking an object. The shrink-merge tracking algorithm is executed, based on the time-continuity of moving-objects, using morphological image processing, such as dilation and erosion. The dilation and erosion are repeatedly executed using the projection processing which the object area in a next frame is derived from the object area in a current frame. The shrink-merge tracking algorithm can also project the area of a rotating-object in a current frame on the rotating-object containing the newly appearing regions in the next frame. The newly automated object extraction method works satisfactory for the objects which are non-linearly moving within the video stream, and also works satisfactory in 450 frames.
The Basic Constructive Logic for Absolute Consistency
Authors: José M. Méndez, Gemma Robles
Venue: Journal of Logic, Language and Information (2009)

In this paper, consistency is understood as absolute consistency (i.e. non-triviality). The basic constructive logic BKc6, which is adequate to this sense of consistency in the ternary relational semantics without a set of designated points, is defined. Then, it is shown how to define a series of logics by extending BKc6 up to contractionless intuitionistic logic. All logics defined in this paper are paraconsistent logics.
Subword Lexical Chaining for Automatic Story Segmentation in Chinese Broadcast News
Authors: Lei Xie, Yulian Yang, Jia Zeng
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

We present a subword lexical chaining approach to automatic story segmentation of Chinese broadcast news (BN). Conventional lexical chains link related words with cohesion (e.g. repetition of words) and high concentration points of starting and ending chains are indicative of story boundaries. However, inevitable speech recognition errors in BN transcripts may destroy the cohesiveness of words, resulting in word match failures. We show the robustness of Chinese subwords (characters and syllables) in lexical matching in errorful ASR transcripts. This motivates us to discover story boundaries on chains formed by character and syllable n-gram units. Experimental results on the TDT2 Mandarin corpus show that chaining by character unigram exhibits the best story segmentation performance with relative F-measure improvement of 6.06% over conventional word chaining. Integrations of multi-scales (words and subwords) exhibit further improvement. For example, fusion by voting from different scales achieves an F-measure gain of 9.04% over words.