ppxscal/embedding_network huggingface dataset:
Study of Noise Enhancing Sense Based on Psychophysical Method
Authors: Jun Liu, Zhengguo Lou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Stochastic resonance phenomenon in a biological sensory system has been studied through signal detection theories and psychophysical experiments. In this paper, a sensory system is considered as a threshold detector including a receiver and a classifier. In comparison with conventional models regarding the receiver of sensory system as a linear or single non-linear system, a summing network is constructed by McCullochPitts (MP) neurons to simulate the receiver. The simulation results reveal that the relevant index of signal detectability exhibit the stochastic resonance characteristics. Theoretic results have been experimentally verified employed 2IFC (two interval two alternative forced choice) method. These works prove that stochastic resonance is not an epiphenomenon in sensory systems.
Algebraic methods in mechanism analysis and synthesis
Authors: Manfred L. Husty, Martin Pfurner, Hans-Peter Schröcker, Katrin Brunnthaler
Venue: Robotica (2007)

Algebraic methods in connection with classical multidimensional geometry have proven to be very efficient in the computation of direct and inverse kinematics of mechanisms as well as the explanation of strange, pathological behavior. In this paper, we give an overview of the results achieved within the last few years using the algebraic geometric method, geometric preprocessing, and numerical analysis. We provide the mathematical and geometrical background, like Study's parametrization of the Euclidean motion group, the ideals belonging to mechanism constraints, and methods to solve polynomial equations. The methods are explained with different examples from mechanism analysis and synthesis.
Evolution determined by trajectory of expected populations: Sufficient conditions, with application to crossover
Authors: I. Douglas Bruce, R. Jamie Simpson
Venue: Evolutionary Computation (1999)

The study of a population's evolution under the action of a genetic operator, or composition of operators, is more difficult when the population size is finite because the examination of the expected population at each generation does not necessarily yield the overall expected result. In certain circumstances, some interesting properties of a population change during evolution in such a way that a valid conclusion can be drawn by charting the change from expected population to expected population. We establish sufficient conditions that ensure that the evolution of a property of a population can be determined by examination of the expected populations only. An example of the application of this characterization is a proof that a finite size population under repeated crossover in the absence of selection or mutation converges, in the sense of expected outcome, to the population with maximum diversity. The proof extends the results already established by others for infinite populations.
Seeds of Cross-Media Production
Authors: Susanne Bødker, Anja Bechmann Petersen
Venue: Computer Supported Cooperative Work (2007)

We present an empirical study of an organization that has recently moved from traditional newspaper production towards cross-media production involving the integrated digital production of newspaper, television, radio and web-news. The paper focuses on the daily production rhythms of the media separately and of cross-media production. Since cross-media production is in the making, we study the instruments currently used for planning and coordination, and analyze them as seeds that will eventually make cross-media production happen. Time and timing are important in news production in general, and our analyses focus on the rhythm of the daily planning, coordination and production processes. Specifically, we analyze the temporal coordination of the activities in and around the Superdesk --- the current center of coordination of the news organization, and of the persons who work specifically with planning and coordination. We demonstrate how the production rhythms of the individual media collide with that of cross-media, and how product lifecycle rhythms add to the list of causes of problems that may jeopardize cross-media production. We propose to strengthen planning and overview support elements of the Superdesk, and the main new coordinator role of the organization. We point out how the media rhythms of newspaper in particular must be backgrounded. To achieve cross-media production, the starting point must be to strengthening and developing further the cross-media rhythms, rather than supplementing individual media rhythms.
Simple and Accurate Models for Capacitance Increment due to Metal Fill Insertion
Authors: Youngmin Kima, D. Petranovic, D. Sylvestera
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Inserting metal fill to improve inter-level dielectric thickness planarity is an essential part of the modern design process. However, the inserted fill shapes impact the performance of signal interconnect by increasing capacitance. In this paper, we analyze and model the impact of the metal dummy on the signal capacitance with various parameters including their electrical characteristic, signal dimensions, and dummy shape and dimensions. Fill has differing impact on interconnects depending on whether the signal of interest is in the same layer as the fill or not. In particular intra-layer dummy has its greatest impact on coupling capacitance while inter-layer dummy has more impact on the ground capacitance component. Based on an analysis of fill impact on capacitance, we propose simple capacitance increment models (Cc for intra-layer dummy and Cg for inter-layer dummy). To consider the realistic case with both signals and metal fill in adjacent layers, we apply a weighting function approach in the ground capacitance model. We verify this model using simple test patterns and benchmark circuits and find that the models match well with field solver results (1.2% average error with much faster runtime than commercial extraction tools, the runtime overhead reduced by ~75% for all benchmark circuits).
New Applications
Authors: D. A. Michalopoulos
Venue: Computer (1975)

Because of a new talking digital voltmeter, a blind engineer in Chicago, Illinois can fulfill his ambition to become a broadcast engineer.
Adaptive sampling in the COlumbia RIvEr observation network
Authors: Thanh Dang, Nirupama Bulusu, Wu-chi Feng, Sergey Frolov, Antonio Baptista
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

The Columbia River (CoRie) Observation Network includes an extensive array of fixed stations monitoring the Columbia River estuary and nearby coastal ocean. At each station, variable combinations of in-situ sensors measure one or more physical properties of water or atmosphere. Using a multi-scale data assimilation model, the CORIE modeling system integrates models and field controls to produce a simulation of 3D circulation, in a region centered in the estuary and plume. The CORIE data assimilation framework [1] combines observational data with numerical data models to produce an estimated system state for the physical process. To augment the fixed observational network, additional data is collected during periodical cruises of a mobile sensor station. Because these cruises are expensive and rare, an important goal for scientists is to sample data at points that most reduce the uncertainty of the data assimilation model. This is challenging, since the estuary environment is very dynamic, and therefore the optimal cruise path cannot be determined in advance. The goal of our system is to move the mobile station as the data assimilation proceeds in order to maximally reduce the uncertainty in the data assimilation process.
Specifying and Verifying Cases Retrieval System Combining Event B and Spin
Authors: Hongjiang Gao, Zheng Qin, Liping Shao, Xingchen Heng
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper presents a complete study for the specification and mechanical verification of cases retrieval systems (CRS) within the generic framework that supports the many-to-many connection of formal development environments and model checkers. We aim at combining on an example, refinement techniques, verification by theorem proving and model checking in an entire development, to guarantee software correctness properties. We first build a underlying abstract system using a roles-based collaboration model, then describe a practical approach for increasingly developing flexible and reliable formal specifications of CRS using Event B, exemplified on Contract Net Protocol (CNP) as interaction contract. A proper translator is introduced as the bridge between formal specifications and model checkers. This entire development is mechanically proved with respect to safety properties using B tool and, complementally, with respect to liveness properties using the SPIN tool.
A Kalman Smoothing Algorithm for Speech Enhancement Based on the Properties of Vocal Tract Varying Slowly
Authors: Hui Li, Xin Wang, Bei-qian Dai, Wei Lu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

The linear prediction coefficients obtained from noisy speech have an important impact on improving the quality of the enhanced speech in the speech enhancement algorithm based on the Kalman Smoother. According to the properties of the slow changes of the vocal tract, this paper proposes a novel Kalman smoothing algorithm for speech enhancement based on vocal tract parameters smoother. Firstly, the linear prediction coefficients are converted into the line spectrum frequency parameters. Then, these parameters of the adjacent frames are smoothed before they transform into state transition matrix. Experimental results indicate that the proposed Kalman smoothing algorithm for speech enhancement based on vocal tract parameters smoother can suppress the sudden changes of residual noise energy and improve the quality of enhanced speech. The quality of the enhanced speech is evaluated by means of segmental SNR and ITU-PESQ scores. Experimental results indicate that the proposed algorithm achieves obvious improvements compared with conventional Wiener filter.
A Computer Algorithm for the Synthesis of Memoryless Logic Circuits
Authors: E. Cerny
Venue: IEEE Transactions on Computers (1974)

A method has been investigated for the synthesis of memoryless logical networks using a restricted repertoire of functional modules. The method is based on the reduced general solution to a generalized system of Boolean equations (BE) as applied to the decomposition of Boolean functions. The aim of the synthesis is to obtain the most constrained circuit having at most two levels of gating. The constraints take the form of single input variables or constant logic levels applied to the inputs of the first level gate. This is achieved by assembling a set of constraint equations which are then a part of the generalized system of BE. The method is then tested on some synthesis examples of single and multiple output functions in terms of the NAND and (WOS) modules.
Comparison of Outlier Detection Methods in Fault-proneness Models
Authors: Shinsuke Matsumoto, Yasutaka Kamei, Akito Monden, Ken-ichi Matsumoto
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

In this paper, we experimentally evaluated the effect of outlier detection methods to improve the prediction performance of fault-proneness models. Detected outliers were removed from a fit dataset before building a model. In the experiment, we compared three outlier detection methods (Mahalanobis outlier analysis (MOA), local outlier factor method (LOFM) and rule based modeling (RBM)) each applied to three well-known fault-proneness models (linear discriminant analysis (LDA), logistic regression analysis (LRA) and classification tree (CT)). As a result, MOA and RBM improved F1-values of all models (0.04 at minimum, 0.17 at maximum and 0.10 at mean) while improvements by LOFM were relatively small (-0.01 at minimum, 0.04 at maximum and 0.01 at mean).
A QoS Multicast Routing Algorithm for Wireless Mesh Networks
Authors: Zongwu Ke, Layuan Li, Qiang Sun, Nianshen Chen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Wireless Mesh Networks (WMNs) have emerged as a key technology for the next-generation wireless networking. Because of their advantages over other wireless networks, WMNs have been wildly accepted in the traditional application sectors of ad hoc network. With increasing demand for real-time services in the next generation wireless networks, quality-of-service (QoS)-based routing offers significant challenges in WMNs. In this paper we propose a multi-constrained QoS-based multicast routing algorithm using the advantage of wireless mesh network. The multi-constrained QoS-multicast routing has been proved an NP-hard problem. Based on CHC genetic algorithm approach, our solution attempts to optimize multiple QoS parameters simultaneously. The CHC selection can preserve the eminent individual in parent population that can solve the problem caused by random select of base GA. In this paper, we use the edge-set to represent multicast tree and we describe initialization, crossover, and mutation operators for this representation. The Simulation results demonstrate that our algorithm is efficient for the wireless mesh networks.
Monotonicity of zeros of Jacobi polynomials
Authors: Dimitar K. Dimitrov, Fernando R. Rafaeli
Venue: Journal of Approximation Theory (2007)

Denote by x"n"k(@a,@b), k=1,...,n, the zeros of the Jacobi polynomial P"n^(^@a^,^@b^)(x). It is well known that x"n"k(@a,@b) are increasing functions of @b and decreasing functions of @a. In this paper we investigate the question of how fast the functions 1-x"n"k(@a,@b) decrease as @b increases. We prove that the products t"n"k(@a,@b)@?f"n(@a,@b)1-x"n"k(@a,@b), where f"n(@a,@b)=2n^2+2n(@a+@b+1)+(@a+1)(@b+1) are already increasing functions of @b and that, for any fixed @a>-1, f"n(@a,@b) is the asymptotically extremal, with respect to n, function of @b that forces the products t"n"k(@a,@b) to increase.
The role of microprogramming in the computer science curriculum
Authors: R. F. Rosin, G. Frieder
Venue: ACM SIGMICRO Newsletter (1972)

Microprogramming is viewed as a concept and technology which has its greatest meaning when applied to the implementation of entire computer systems, as opposed to its usage in computer control units alone. Rather than being presented on a stand-alone basis, microprogramming should be treated as just one important alternative in all computer science courses which deal with computer system implementation, whether such systems are conceived in hardware, software, or a combination of the two. Examples are shown of the appearance of microprogramming in a variety of such courses.
Distributed Diagnosis of Failures in a Three Tier E-Commerce System
Authors: Gunjan Khanna, Ignacio Laguna, Fahad A. Arshad, Saurabh Bagchi
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

For dependability outages in distributed internet infrastructures, it is often not enough to detect a failure, but it is also required to diagnose it, i.e., to identify its source. Complex applications deployed in multi-tier environments make diagnosis challenging because of fast error propagation, black-box applications, high diagnosis delay, the amount of states that can be maintained, and imperfect diagnostic tests. Here, we propose a probabilistic diagnosis model for arbitrary failures in components of a distributed application. The monitoring system (the Monitor) passively observes the message exchanges between the components and, at runtime, performs a probabilistic diagnosis of the component that was the root cause of a failure. We demonstrate the approach by applying it to the Pet Store J2EE application, and we compare it with Pinpoint by quantifying latency and accuracy in both systems. The Monitor outperforms Pinpoint by achieving comparably accurate diagnosis with higher precision in shorter time.
Programming Languages and Direct-Execution Computer Architecture
Authors: Yaohan Chu
Venue: Computer (1981)

Besides offering fast execution speed, the direct-execution architecture permits highly interactive programming, language definition, and the measurement of language complexity.
Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment
Authors: Yeim-Kuan Chang, Jia-Hwa Wu, Chi-Yeh Chen, Chih-Ping Chu
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

In the divisible load distribution, the classic methods on linear arrays divide the computation and communication processes into multiple time intervals in a pipelined fashion. Li (2003) has proposed a set of improved algorithms for linear arrays which can be generalized to k-dimensional meshes. In this paper, we first propose the algorithm M (multi-installment) that employs the multi-installment technique to improve the best algorithm Q proposed by Li. Second, we propose the algorithm S (start-up cost) that includes the computation and communication start-up costs in the design. While the asymptotic speedups of our algorithms M and S derived from the closed-form solutions are the same as algorithm Q, our algorithms approach the optimal speedups considerably faster than algorithm Q as the number of processors increases. Finally, we combine algorithms M and S and propose the algorithm MS. While algorithm MS has the same the asymptotic performance as algorithms Q and S, it achieves a better speedup when the load to be processed is very large and the number of processors is fixed or when the load to be processed is fixed and the number of processors is small.
On the correctness criteria of fine-grained access control in relational databases
Authors: Qihua Wang, Ting Yu, Ninghui Li, Jorge Lobo, Elisa Bertino, Keith Irwin, Ji-Won Byun
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Databases are increasingly being used to store information covered by heterogeneous policies, which require support for access control with great flexibility. This has led to increasing interest in using fine-grained access control, where different cells in a relation may be governed by different access control rules. Although several proposals have been made to support fine-grained access control, there currently does not exist a formal notion of correctness regarding the query answering procedure. In this paper, we propose such a formal notion of correctness in fine-grained database access control, and discuss why existing approaches fall short in some circumstances. We then propose a labeling approach for masking unauthorized information and a query evaluation algorithm which better supports fine-grained access control. Finally, we implement our algorithm using query modification and evaluate its performance.
Statistical mechanics of Arakawa's discretizations
Authors: Svetlana Dubinkina, Jason Frank
Venue: Journal of Computational Physics (2007)

The results of statistical analysis of simulation data obtained from long time integrations of geophysical fluid models greatly depend on the conservation properties of the numerical discretization used. This is illustrated for quasi-geostrophic flow with topographic forcing, for which a well established statistical mechanics exists. Statistical mechanical theories are constructed for the discrete dynamical systems arising from three discretizations due to Arakawa [Arakawa, Computational design for long-term numerical integration of the equations of fluid motion: two-dimensional incompressible flow. Part I. J. Comput. Phys. 1 (1966) 119-143] which conserve energy, enstrophy or both. Numerical experiments with conservative and projected time integrators show that the statistical theories accurately explain the differences observed in statistics derived from the discretizations.
The Design of Optimal Systolic Arrays
Authors: Guo-Jie Li
Venue: IEEE Transactions on Computers (1985)

Conventional design of systolic arrays is based on the mapping of an algorithm onto an interconnection of processing elements in a VLSI chip. This mapping is done in an ad hoc manner, and the resulting configuration usually represents a feasible but suboptimal design. In this paper, systolic arrays are characterized by three classes of parameters: the velocities of data flows, the spatial distributions of data, and the periods of computation. By relating these parameters in constraint equations that govern the correctness of the design, the design is formulated into an optimization problem. The size of the search space is a polynomial of the problem size, and a methodology to systematically search and reduce this space and to obtain the optimal design is proposed. Some examples of applying the method, including matrix multiplication, finite impulse response filtering, deconvolution, and triangular-matrix inversion, are given.
Social Conventions to Promise Learning Convergence
Authors: Meiping Song, Rong Chen, Jubai An
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Convergence is an important problem in the current learning algorithms for multi-agent system. The diversity of solutions causes it difficult for all agents in the system to unify their selections. The social conventions are prompted for the system during learning, which will help deciding the unique game solution for the system and promising the learning convergence therefore.
Image Segmentation Method Based on Fuzzy Entropy and Grey Relational Analysis
Authors: Yuanyuan Liu, Wenbo Liu, Ziyang Zhen, Gong Zhang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

allusion to the sensitivity towards the noise of the traditional fuzzy entropy method, an improved image segmentation method based on fuzzy entropy and grey relational analysis is proposed in the paper. In this modification, the grey relational degree is introduced to express the degree of the pixels belonging to the object or background accurately. we select the current pixel and its neighborhood pixels as the comparative sequence, and compute the grey relational degree between the comparative sequence and the reference sequence, based on which the membership function of the fuzzy entropy function is redefined in which the membership of the current pixel is determined not only by its own gray value but also by the gray values of its neighborhood pixels. The segmentation experimental results of the Cameraman, MR and Tire images demonstrate the good performance of reducing the noise by the improved method.
Fuzzy Key Extraction from Fingerprint Biometrics based on Dynamic Quantization Mechanism
Authors: Thian Song Ong, Andrew Beng Jin Teoh
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Traditional biometrics recognition system is vulnerable to privacy invasion when the stored biometric template is compromised. This in turn will suffer from permanently loss as biometric template is not replaceable In this paper, we propose a key extraction scheme which locks a secure transformed fingerprint bitstring via a novel dynamic quantization mechanism. During authentication stage, the key is extracted from the secure mixture when a genuine fingerprint is presented. A number of keys can be assigned to different applications and could be revoked if the key was compromised. The proposed method retrieve key reliably from a genuine fingerprint up to 99.5% success rate. We perform several security and experimental analyses and the results suggest that the scheme is feasible in practice.