ppxscal/embedding_network huggingface dataset:
On the distribution function of the complexity of finite sequences
Authors: Janusz Szczepanski
Venue: Information Sciences: an International Journal (2009)

Investigations of complexity of sequences lead to important applications such as effective data compression, testing of randomness, discriminating between information sources and many others. In this paper we establish formulae describing the distribution functions of random variables representing the complexity of finite sequences introduced by Lempel and Ziv in 1976. It is known that this quantity can be used as an estimator of entropy. We show that the distribution functions depend affinely on the probabilities of the so-called ''exact'' sequences.
Pattern Matching with Swaps for Short Patterns in Linear Time
Authors: Domenico Cantone, Simone Faro
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T, when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one seeks, for every text location with a swapped match of P, the number of swaps necessary to obtain a match at the location.In this paper, we present a new approach for solving both the Swap Matching problem and the Approximate Swap Matching problem in linear time, in the case of short patterns. In particular, we devise a $\mathcal{O}(nm)$ general algorithm, named Cross-Sampling, and show an efficient implementation of it, based on bit-parallelism, which achieves $\mathcal{O}(n)$ worst-case time and $\mathcal{O}(\sigma)$-space complexity, with patterns whose length is comparable to the word-size of the target machine.
theRelativity
Authors: Jun Fujiki, Shigeru Owada
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

Our impression of a scene changes depending on the aspect. theRelativity is an interactive art work that seamlessly reflects a third-person view of a structure into a first-person view.
An application of neural network solution in the apparel industry for cutting time forecasting
Authors: Yelda Ozel, Mahmut Kayar
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

Artificial Neural Network is proposed to handle to estimating of "marker making" cutting time. Estimating the optimum cutting time greatly affects the production efficiency and daily production capacity of the cutting department. Using ANN system in a factory, different marking lengths and their obtained calculated cutting times, the data (from number of fabric layers, cutting blade speed, number of sizes, marking lengths, and cutting times) are applied to the system. Different fabric lays quantities end resulting cutting time actively possible fabric lays quantities for calculation the necessary cutting times estimated realized, the presentation of the most helpful optimum fabric lays quantities calculation for making decisions is made.
Content-Aware Fast Motion Estimation for H.264/AVC
Authors: Zhenyu Liu, Satoshi Goto, Takeshi Ikenaga
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The key to high performance in video coding lies on efficiently reducing the temporal redundancies. For this purpose, H.264/AVC coding standard has adopted variable block size motion estimation on multiple reference frames to improve the coding gain. However, the computational complexity of motion estimation is also increased in proportion to the product of the reference frame number and the intermode number. The mathematical analysis in this paper reveals that the prediction errors mainly depend on the image edge gradient amplitude and quantization parameter. Consequently, this paper proposes the image content based early termination algorithm, which outperforms the original method adopted by JVT reference software, especially at high and moderate bit rates. In light of rate-distortion theory, this paper also relates the homogeneity of image to the quantization parameter. For the homogenous block, its search computation for futile reference frames and intermodes can be efficiently discarded. Therefore, the computation saving performance increases with the value of quantization parameter. These content based fast algorithms were integrated with Unsymmetrical-cross Multihexagon-grid Search (UMHexagonS) algorithm to demonstrate their performance. Compared to the original UMHexagonS fast matching algorithm, 26.14–54.97% search time can be saved with an average of 0.0369 dB coding quality degradation.
AIEIA: Software for fuzzy environmental impact assessment
Authors: A. Blanco Morón, M. Delgado Calvo-Flores, J. M. Martín Ramos, M. P. Polo Almohano
Venue: Expert Systems with Applications: An International Journal (2009)

Human activity has an inevitable impact on the environment and this is generally negative. It is undeniable that society is increasingly aware of the state of the surrounding environment, since it forms the basis for all human activity. There has therefore been a proliferation of environmental impact assessment (EIA) tools which enable this impact on the environment to be measured. The EIA process involves an enormous amount of quantitative and qualitative information which traditional EIA methods are unable to handle properly. This article presents a new fuzzy EIA model which perfectly incorporates both qualitative and quantitative information, using in its formulation the fuzzy set theory proposed by Zadeh. We also present AIEIA, an ingenious software program which implements this fuzzy methodology by providing an efficient tool for the prevention of environmental impacts.
Block-Mode Classification Using SVMs for Early Termination of Block Mode Decision in H.264|MPEG-4 Part 10 AVC
Authors: Jaeil Kim, Munchurl Kim, Sangjin Hahm, In-joon Cho, Changsub Park
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper, a two-stage block-mode classification scheme of H.264|MPEG-4 Part 10 AVC is presented as a pattern classification approach using SVMs in order to reduce high computational complexity of its encoders. For the block-mode classification, the feature vectors for each macroblock are formed for the SVMs with SATD and CBP values to detect the large and small block modes. From the experimental results, the proposed scheme yields 80% and 95% of the correct classification rate in average for the first and second stage, which has led to from 35% to 55% reduction in the total encoding time while maintaining negligible amounts of bit rate increases and PSNR drops for test sequences with QCIF, CIF, and 4CIF resolutions and various quantization parameter values.
Simulation of modular building construction
Authors: Osama M. Mohsen, Paul J. Knytl, Basel Abdulaal, Jacek Olearczyk, Mohamed Al-Hussein
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Modular construction has the advantage of producing structures quickly and efficiently, while not requiring the resources to build a structure to be co-located with the construction site. Large modules can be produced in quality controlled environments, and then shipped to the construction site and assembled with minimal labor requirements. An additional advantage is that once the modules are on-site, construction can proceed extremely quickly. This is ideal for situations where compressed schedules are required in order to meet client's time constraints. This paper examines using software simulation, specifically Simphony.NET, in the design and analysis of the construction process. This is done both before and after project execution to predict productivity and duration and also to allow for exploration of alternate construction scenarios.
New statistical methods for detecting point alignments
Authors: Ø. Hammer
Venue: Computers Geosciences (2009)

Detection of straight-linear point alignments has a number of geological applications. Assessing the statistical significance of such alignments is relatively straightforward in the case of overall lineament orientation, but becomes complicated for non-stationary point patterns where the orientations as well as positions of individual lineaments are to be determined. False positive (Type I error) rates are here estimated using Monte Carlo simulation, both for the existing ''blade'' method and for some new, simple procedures. For the blade method, the false positive rate can be an order of magnitude higher than specified by the @a level, while for the new methods the false positive rate is in good accordance with the @a level. The methods are also compared using two synthetic data sets, and a real example of pockmarks from the Norwegian Sea.
A study of academic performance of business school graduates using neural network and statistical techniques
Authors: Mukta Paliwal, Usha A. Kumar
Venue: Expert Systems with Applications: An International Journal (2009)

Over the past several years, there is tremendous increase in the number of applicants to business schools and hence adequately measuring the potential of these students with regard to their academic performance is an important process of admission decision for any business school. In the present study, an analysis is carried out to predict the academic performance of business school graduates using neural networks and traditional statistical techniques and results are compared to evaluate the performance of these techniques. The underlying constructs in a traditional business school curriculum are also identified and its relevance with the various elements of admission process is presented.
INFOPLEX: hierarchical decomposition of a large information management system using a microprocessor complex
Authors: Stuart E. Madnick
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The effective use of computer systems for large-scale information management rather than numerical computation is still a largely unsolved problem. In this paper important concepts and theories regarding computer architectures for information management are introduced. The underlying concept, hierarchical decomposition, is presented in the next section.
Artificial neural networks for modeling in reaction process systems
Authors: Cristina Oliveira, Petia Georgieva, Fernando Rocha, Sebasti&#x00e3;o Feyo de Azevedo
Venue: Neural Computing and Applications (2009)

This work is focused on developing a more efficient computational scheme for estimation of process reaction rates based on NN models. Two scenarios are considered: (1) the kinetics coefficients of the process are completely known and the process states are partly known (measured); (2) the kinetics coefficients and the states of the process are partly known. The contribution of the paper is twofold. From one side we formulate a hybrid (ANN and mechanistic) model that outperforms the traditional reaction rate estimation approaches. From other side, a new procedure for NN supervised training is proposed when target outputs are not available. The two scenarios are successfully tested for two benchmark problems, estimation of the precipitation rate of calcium phosphate and estimation of sugar crystallization growth rate.
The architecture of MANIP: a parallel computer system for solving NP-complete problems
Authors: Benjamin W. Wah, Y. W. Ma
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

In this paper, we study the network architecture of MANIP, a parallel Machine for processing Non-deterministic Polynomial complete problems. The most general technique that can be used to solve a wide variety of NP-complete problems on a uni-processor system, optimally or sub-optimally, is the branch and bound algorithm. We have adapted and extended the branch and bound algorithm for parallel processing. The parallel branch and bound algorithm requires a combination of sorting and merging. A common memory to sort for a large number of processors can become a bottleneck in the system. We have proposed a system with distributed intelligence so that sorting can be carried out in a distributed fashion. A uni-directional ring network is proved to be-the optimal and most cost-effective inter-processor communication network when sorting is done by a hardware priority queue in each processor.
On the degrees of freedom in shrinkage estimation
Authors: Kengo Kato
Venue: Journal of Multivariate Analysis (2009)

We study the degrees of freedom in shrinkage estimation of regression coefficients. Generalizing the idea of the Lasso, we consider the problem of estimating the coefficients by minimizing the sum of squares with the constraint that the coefficients belong to a closed convex set. Based on a differential geometric approach, we derive an unbiased estimator of the degrees of freedom for this estimation method, under a smoothness assumption on the boundary of the closed convex set. The result presented in this paper is applicable to estimation with a wide class of constraints. As an application, we obtain a C"p type criterion and AIC for selecting tuning parameters.
Experimental evaluation of horizontal and vertical scalability of cluster-based application servers for transactional workloads
Authors: Daniel F. Garcia, Rodrigo Garcia, Joaquín Entrialgo, Javier Garcia, Manuel Garcia
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

The scalability of the application servers is an essential issue to guarantee the quality of the services provided by any company that sell its products and services through Internet in business-to-business (B2B) environments. This paper deals with the selection of a proper transactional load to evaluate the scalability, in order to obtain representative results that can provide useful insights for a large range of transactional applications. This evaluation work compares the scalability and other related performance metrics when an application server cluster is scaled horizontally, adding new servers, and when it is scaled vertically, adding cores into the servers. Multiple issues related with the proper experimental design to carry out an evaluation work of these characteristics are also presented in this paper. Finally, it is important to remark that there are few works in the literature concerning the scalability evaluation of transactional systems, in spite of the critical importance of the scalability in this kind of systems.
Top-k dominating queries in uncertain databases
Authors: Xiang Lian, Lei Chen
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Due to the existence of uncertain data in a wide spectrum of real applications, uncertain query processing has become increasingly important, which dramatically differs from handling certain data in a traditional database. In this paper, we formulate and tackle an important query, namely probabilistic top-k dominating (PTD) query, in the uncertain database. In particular, a PTD query retrieves k uncertain objects that are expected to dynamically dominate the largest number of uncertain objects. We propose an effective pruning approach to reduce the PTD search space, and present an efficient query procedure to answer PTD queries. Furthermore, approximate PTD query processing and the case where the PTD query is issued from an uncertain query object are also discussed. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed PTD query processing approaches.
Zone design and control for vehicle collision prevention and load balancing in a zone control AGV system
Authors: Ying-Chin Ho, Ta-Wei Liao
Venue: Computers and Industrial Engineering (2009)

Because of their routing flexibility, automated guided vehicles (AGVs) have been used in many manufacturing systems, especially those in which parts with diverse and complex processing routes are made. In recent years, there have been many studies on AGV-related problems. One of them is preventing the collision of vehicles. Some traditional vehicle collision prevention strategies are zone strategies that divide guide paths into several non-overlapping zones and restrict the presence of only one vehicle in any zone at any time. Traditional zone strategies are fixed zone strategies in which the area of a zone is fixed and vehicles are not allowed to help each other. Because of these restrictions, fixed zone strategies cannot always satisfy the system's transportation demand if there is a load imbalance between vehicles of different zones. In this paper, a new zone strategy is proposed for a zone control AGV system with a network guide path. The proposed strategy is a dynamic zone strategy, which is different from a fixed zone strategy. It relies on two methods - zone partition design and dynamic zone control - to prevent the collision of vehicles and to maintain the load balance between the vehicles of different zones. The zone partition design defines a relationship coefficient, which measures both the distance relationship and the flow relationship between workstations, and uses it to find an initial zone partition design. We then improve this initial design by an SA (Simulated Annealing) based improvement procedure to achieve a better load balance result. The dynamic zone control uses two methods - zone repartition and load sharing - to ensure that vehicle collision can be prevented and the system's load balance can be maintained when the system is in operation. Simulation experiments were conducted to understand the performance of the proposed strategy. The simulation results show that the proposed strategy outperform the fixed zone strategy in throughput, WIP inventory, and flow time. The results also show that the proposed strategy is able to adapt to any changes (in the system) that cause the load imbalance problem between zones.
Body and mind: a study of avatar personalization in three virtual worlds
Authors: Nicolas Ducheneaut, Ming-Hui Wen, Nicholas Yee, Greg Wadley
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

An increasingly large number of users connect to virtual worlds on a regular basis to conduct activities ranging from gaming to business meetings. In all these worlds, users project themselves into the environment via an avatar: a 3D body which they control and whose appearance is often customizable. However, considering the prevalence of this form of embodiment, there is a surprising lack of data about how and why users customize their avatar, as well as how easy and satisfying the existing avatar creation tools are. In this paper, we report on a study investigating these issues through a questionnaire administered to more than a hundred users of three virtual worlds offering widely different avatar creation and customization systems (Maple Story, World of Warcraft, and Second Life). We illustrate the often-surprising choices users make when creating their digital representation and discuss the impact of our findings for the design of future avatar creation systems.
Pyramids: an efficient computational geometry-based approach for timing-driven placement
Authors: Tao Luo, David A. Papa, Zhuo Li, C. N. Sze, Charles J. Alpert, David Z. Pan
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The purpose of global placement is to find non-overlapping locations for cells, typically while minimizing a wirelength objective. Because of this objective, however, when more timing information about the design is known, some cells will inevitably be sub-optimally placed from a timing perspective. In this paper, we present two new techniques to incrementally improve placements by moving cells to their optimal timing locations. We call our approach Pyramids, since it uses pyramid-shaped delay surfaces to solve for the optimal location, rather than running a more expensive linear programming solver. We show how to apply these techniques to timing-driven detailed placement and also for more accurate latestage incremental timing correction. Experimental results validate the effectiveness of Pyramids by showing significantly improved timing after an industrial placement algorithm. Furthermore, compared to the linear programming solvers, the speedup of Pyramids solver is 373x vs. CLP and 448x vs. GLPK.
Privacy policies compliance across digital identity management systems
Authors: Anna C. Squicciarini, Alexei Czeskis, Abhilasha Bhargav-Spantzel
Venue: Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS (2008)

An emerging approach for protecting identities of individuals, while at the same time enhancing user convenience, is represented by federated identity management systems. In this paper we develop an approach to support privacy controlled sharing of identity attributes in federated environments. We present a wide range of strategies that enable users to trace their personal information across the federation and verify whether it has been managed according to their privacy preferences. Users can employ one or more of these strategies according to their goals and priorities. Additionally, we analyze the challenging issue of data, privacy policy, and preference updates in a federated system. Our algorithm allows users and federated service providers to control whether new versions of data and users' privacy references have been used, and detect possible inconsistencies.
The C.M.A. information base: a beginning of operational systems in Canada
Authors: Jan F. Brandejs
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Although we can trace the beginning of the pre-paid medical care in Canada as far back as the 17th Century (Master Surgeon contract to provide medical services to several families in the community of Ville Marie---now Montreal), the nationwide acceptance of pre-paid medical care insurance plans took a relatively short period i.e., 25 years from 1946 to 1970.
Intrusion Detection Method Based on Wavelet Neural Network
Authors: Jianjing Sun, Han Yang, Jingwen Tian, Fan Wu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Aimed at the intrusion behaviors are characterized with uncertainty, complexity, diversity and dynamic tendency and the advantages of wavelet neural network (WNN), an intrusion detection method based on WNN is presented in this paper. Moreover, we adopt a algorithm of reduce the number of the wavelet basic function by analysis the sparseness property of sample data which can optimize the wavelet network in a large extent, and the learning algorithm based on the gradient descent was used to train network. We discussed and analyzed the impact factor of intrusion behaviors. With the ability of strong nonlinear function approach and fast convergence rate of WNN, the intrusion detection method based on WNN can detect various intrusion behaviors rapidly and effectively by learning the typical intrusion characteristic information. The experimental result shows that this intrusion detection method is feasible and effective.