ppxscal/embedding_network huggingface dataset:
Computer Jobs with the Growing Information Technology Professional Services Sector
Authors: Info Tech Employment
Venue:  (2007)

The solid and growing information technology professional services sector continues to increase headcount. Discover computer jobs in this robust sector of the industry. Computer jobs will continue to go to the IT professional services sector as long as companies rely increasingly on computer know-how. This book gives sure-fire direction to good employment for the graduate and professional. The book has been praised for showing where the jobs are in all 50 U.S. States. Analytical Articles: C++ Computer . Java and JavaScript . Visual Basic . Sun Solaris, Unix, Linux, Network Tech Jobs . Oracle, SQL, FoxPro, Sybase, Database Management . Software Programmer; Software Engineer . Network Programmer, Network Systems . Telecommunications . Web Developer . IT Procurement, IT Training, Project Management . IT Security . Computer Graphics, Computer Animation Advisory Articles: Careers in IT . Hiring Options: . IT Outsourcers, IT Service Providers, In-House IT Staff . Job Supply Chains for the Industry . Telecommuting IT Careers, Entry-Level Tech Jobs . IT Resume Samples, Professional IT Resumes, Free IT Resumes . Skills Employers Require of IT Professionals; . Training Opportunities, Free Training . Tech Jobs: Tips for Boosting Your Tech Job Search . Computer Careers: Building a Successful Computer Career
Concurrent Error Detection in Digit-Serial Normal Basis Multiplication over GF(2m)
Authors: Chiou-Yng Lee
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Parity prediction schemes have been widely studied in the past. Recently, it has been demonstrated that this prediction scheme can achieve Fault-Secureness in arithmetic circuits for stuck-at and stuck-open faults. For most cryptographic applications, encryption/decryption algorithms rely on computations in very large finite fields. The hardware implementation may require millions of logic gates and this may lead to the generation of erroneous outputs by the multiplier. In this paper, a concurrent error detection (CED) technique is used in the digit-serial basis multiplier over finite fields of characteristic two. It is shown that all types of normal basis multipliers possess the same parity prediction function.
Uplink SDMA with limited feedback: throughput scaling
Authors: Kaibin Huang, Robert W. Heath,  Jr., Jeffrey G. Andrews
Venue: EURASIP Journal on Advances in Signal Processing (2008)

Combined space division multiple access (SDMA) and scheduling exploit both spatial multiplexing and multiuser diversity, increasing throughput significantly. Both SDMA and scheduling require feedback of multiuser channel sate information (CSI). This paper focuses on uplink SDMA with limited feedback, which refers to efficient techniques for CSI quantization and feedback. To quantify the throughput of uplink SDMA and derive design guidelines, the throughput scaling with system parameters is analyzed. The specific parameters considered include the numbers of users, antennas, and feedback bits. Furthermore, different SNR regimes and beamforming methods are considered. The derived throughput scaling laws are observed to change for different SNR regimes. For instance, the throughput scales logarithmically with the number of users in the high SNR regime but double logarithmically in the low SNR regime. The analysis of throughput scaling suggests guidelines for scheduling in uplink SDMA. For example, to maximize throughput scaling, scheduling should use the criterion of minimum quantization errors for the high SNR regime and maximum channel power for the low SNR regime.
Classification of LARGE-liked GlcNAc-Transferases of Dictyostelium discoideum by Phylogenetic Analysis
Authors: Kuo-Yuan Hwa, Te-Ling Pang, Mei-Yu Chen
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

GlcNAc transferases are important enzymes involved in protein glycosylation, a cellular process controlling life-time, location and function of proteins. Previously, four new genes in Dictyostelium discoideum through a forward genetic screening, and BLASP search are annotated as gnt12 (GlcNAc Transferase), gnt13, gnt14, and gnt15 since their deduced amino acid sequences share significant similarity to mammalian LARGE, a GlcNAC glycosyltransferase involved on the functional maturation of -dystroglycan, a key molecule associated with human muscular dystrophy. However, the four genes of Dicystelium are not included in CAZy (Carbohydrate-Active enZymes) database, in which glycosyltransferases were classified based on structural, reaction mechanism and sequence similarities. Here we presented our bioinformatics analysis workflow based on phylogentic analysis to determine if these four genes are in related to the glycosyltransferase 2 and/or 49 families. And, we have also provided the experimental evidence with altered glycosylation pattern in the genetic engineered mutant of gnt 15-.
A Comparative Study of Staff Removal Algorithms
Authors: Christoph Dalitz, Michael Droettboom, Bastian Pranzas, Ichiro Fujinaga
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

This paper presents a quantitative comparison of different algorithms for the removal of stafflines from music images. It contains a survey of previously proposed algorithms and suggests a new skeletonization based approach. We define three different error metrics, compare the algorithms with respect to these metrics and measure their robustness with respect to certain image defects. Our test images are computer-generated scores on which we apply various image deformations typically found in real-world data. In addition to modern western music notation our test set also includes historic music notation such as mensural notation and lute tablature. Our general approach and evaluation methodology is not specific to staff removal, but applicable to other segmentation problems as well.
Toward establishing trust in adaptive agents
Authors: Alyssa Glass, Deborah L. McGuinness, Michael Wolverton
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

As adaptive agents become more complex and take increasing autonomy in their user's lives, it becomes more important for users to trust and understand these agents. Little work has been done, however, to study what factors influence the level of trust users are willing to place in these agents. Without trust in the actions and results produced by these agents, their use and adoption as trusted assistants and partners will be severely limited. We present the results of a study among test users of CALO, one such complex adaptive agent system, to investigate themes surrounding trust and understandability. We identify and discuss eight major themes that significantly impact user trust in complex systems. We further provide guidelines for the design of trustable adaptive agents. Based on our analysis of these results, we conclude that the availability of explanation capabilities in these agents can address the majority of trust concerns identified by users.
Probing dynamic human facial action recognition from the other side of the mean
Authors: Cristóbal Curio, Martin A. Giese, Martin Breidt, Mario Kleiner, Heinrich H. Bülthoff
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

Insights from human perception of moving faces have the potential to provide interesting insights for technical animation systems as well as in the neural encoding of facial expressions in the brain. We present a psychophysical experiment that explores high-level after-effects for dynamic facial expressions. We address specifically in how far such after-effects represent adaptation in neural representation for static vs. dynamic features of faces. High-level after-effects have been reported for the recognition of static faces [Webster and Maclin 1999; Leopold et al. 2001], and also for the perception of point-light walkers [Jordan et al. 2006; Troje et al. 2006]. After-effects were reflected by shifts in category boundaries between different facial expressions and between male and female walks. We report on a new after-effect in humans observing dynamic facial expressions that have been generated by a highly controllable dynamic morphable face model. As key element of our experiment, we created dynamic 'anti-expressions' in analogy to static 'anti-faces' [Leopold et al. 2001]. We tested the influence of dynamics and identity on expression-specific recognition performance after adaptation to 'anti-expressions'. In addition, by a quantitative analysis of the optic flow patterns corresponding to the adaptation and test expressions we rule out that the observed changes reflect a simple low-level motion after-effect. Since we found no evidence for a critical role of temporal order of the stimulus frames we conclude that after-effects in dynamic faces might be dominated by adaptation to the form information in individual stimulus frames.
Security Engineering in IT Governance for University Information System
Authors: Ho-Yeol Kwon
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

IT governance becomes one of hot issues in corporate information system including university ERP. IT governance provides IT value and mitigatesIT-related risks such that the organization takes new business chances and grows in the future. In this paper, we briefly introduced IT governance with security engineering and university information system. And then, we proposed a strategic approach of IT governance for university information system with new performance criteria.
A software tool for teaching of particle swarm optimization fundamentals
Authors: Leandro dos Santos Coelho, Cezar Augusto Sierakowski
Venue: Advances in Engineering Software (2008)

Swarm intelligence courses have been offered at many universities all over the world from early 1990s. However, the field of Particle Swarm Optimization (PSO) - a swarm intelligence technique - is still relatively young without any standard teaching method. This paper describes an educational software tool for aid the teaching of PSO fundamentals in MATLAB^(C) (MATrix LABoratory) software environment of MathWorks. In this context, an application of mobile robotics planning is developed with a friendly graphical user interface in MATLAB for teaching PSO design. Graduate students of Intelligent Systems course of Industrial and Systems Engineering Graduate Program at Pontifical Catholic University of Parana (PUCPR, Brazil) can then use this educational software tool called PSOLeT (particle swarm optimization learning tool) to learn and evaluate basic optimization designs. This paper also summarizes the proposed software tool and gives an application in mobile robotics.
SOVoIP: middleware for universal VoIP connectivity
Authors: M. J. Arif, S. Karunasekera, S. Kulkarni
Venue: Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion (2007)

Voice over Internet Protocol (VoIP) is one of the most prominent communications technologies today. The introduction of VoIP has resulted in a number of VoIP specific protocols those are not interoperable. Thus the next logical step is to make these and other existing protocols on the Internet talk to each other to bring about true convergence between voice and data. Naturally middleware that connects different software, platforms and protocols comes into the picture. In this paper we introduce a middleware based VoIP architecture, Service Oriented VoIP (SOVoIP), which ensures protocol convergence while addressing many critical issues related to VoIP such as: NAT and firewall traversal. We compare our solution with widely used existing VoIP solutions.
On quantum pure state geometry
Authors: Hiroshi Hasegawa
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

A Fréchet partial differential formula ∂ρ(θ)/∂θi(Ai)=∂cρ(θ)/∂θiAic+[ρ(theta;), δAi i=1,2,..,m≤n2 is shown to identify the m vectors {δi} with the set of operator covariance for parameter evolution introduced by Anandan-Aharonov and Abe.
Distributed Access Scheduling Algorithms in Wireless Mesh Networks
Authors: Hongju Cheng, Naixue Xiong, Laurence T. Yang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In this paper we have considered the distributed scheduling problem for channel access in wireless mesh networks. The problem is to assign time-slots for each node in the network to access the control channels so that it is guaranteed that each node can broadcast the control packet to any one-hop neighbor in one scheduling cycle. The objective is to minimize the total number of different time-slots in the scheduling cycle. In the single-channel ad hoc networks, the known best result for this problem is proved to be (K2 + 1) in arbitrary graphs [2] and 25K in unit disk graphs [14] with K as the maximum node degree. The original contributions of this paper are that it has taken the large interference range problem into consideration for the first time and proposed two algorithms for the scheduling problem, namely, the One Neighbor per Cycle (ONPC) algorithm and the All Neighbors per Cycle (ANPC) algorithm. We prove that the number of time-slots by the second algorithm is upper-bounded by 2K in some special case. The fully distributed versions of these algorithms are given in this paper. Simulation results also show that the performance of ANPC is rather better than ONPC.
Fresh from the lab
Authors: John Knight
Venue: Linux Journal (2008)

New softwareï¾¿Zero Install System, deco and orDrumbox.
On the constant-depth complexity of k-clique
Authors: Benjamin Rossman
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We prove a lower bound of ω(nk/4) on the size of constant-depth circuits solving the k-clique problem on n-vertex graphs (for every constant k). This improves a lower bound of ω(nk/89d2) due to Beame where d is the circuit depth. Our lower bound has the advantage that it does not depend on the constant d in the exponent of n, thus breaking the mold of the traditional size-depth tradeoff. Our k-clique lower bound derives from a stronger result of independent interest. Suppose fn :0,1n/2 → {0,1} is a sequence of functions computed by constant-depth circuits of size O(nt). Let G be an Erdos-Renyi random graph with vertex set {1,...,n} and independent edge probabilities n-α where α ≤ 1/2t-1. Let A be a uniform random k-element subset of {1,...,n} (where k is any constant independent of n) and let KA denote the clique supported on A. We prove that fn(G) = fn(G ∪ KA) asymptotically almost surely. These results resolve a long-standing open question in finite model theory (going back at least to Immerman in 1982). The m-variable fragment of first-order logic, denoted by FOm, consists of the first-order sentences which involve at most m variables. Our results imply that the bounded variable hierarchy FO1 ⊂ FO2 ⊂ ... ⊂ FOm ⊂ ... is strict in terms of expressive power on finite ordered graphs. It was previously unknown that FO3 is less expressive than full first-order logic on finite ordered graphs.
Real time hardware vision system design
Authors: Pedro Cobos Arribas
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

This paper describes an electronic system designed for real-time vision applications. The system will allow the development of low-complexity tasks, such as obstacle detection, at very high frequencies. This makes it useful for robotic applications and control systems in real time (up to 25 images per second). Its design has taken into account low-cost and flexible modular solutions that can be applied in research laboratories or used with engineering students in order to make real time image process practices.
On Non-Uniform Rational B-Splines Surface Neural Networks
Authors: Ming-Yang Cheng, Hung-Wen Wu, Alvin Wen-Yu Su
Venue: Neural Processing Letters (2008)

A novel bi-variate non-uniform rational B-splines (NURBS) surface neural network consisting of four hidden layers is proposed in this paper. The blending functions are selected as the activation functions for the neurons in one of the hidden layers, instead of the commonly used sigmoid functions. With mathematical derivations, it is easy to find that the mathematical expression of the output of the proposed neural network is exactly the same as the NURBS surface. Since a set of 2-D gray scale image data can be considered as a 3-D surface, therefore the proposed NURBS surface neural network can be applied to deal with image processing problems. Two experiments, concerning image compression and corrupted image restoration, are conducted to demonstrate the feasibility of the proposed approach.
Multi-dimensional Compression Using JPEG2000
Authors: Hariharan G. Lalgudi, Ali Bilgin, Michael W. Marcellin, Mariappan S. Nadar
Venue: Proceedings of the Data Compression Conference (2008)

JPEG2000 Part 2 supports the use of multi-component transforms (MCT) to decorrelate multi-component images along the component direction. Such point transforms can be performed on arbitrary subsets of components, known as 'component collections.' These Part 2 extensions have been used for compressing 3-D images in applications such as medical imaging and remote sensing. It is widely believed that the MCT extensions are applicable only to 3-D data. In this work, we demonstrate their use for compressing N-D datasets for any N >= 3.
NLWCA Node and Link Weighted Clustering Algorithm for Backbone-Assisted Mobile Ad Hoc Networks
Authors: Adrian Andronache, Steffen Rothkugel
Venue: Proceedings of the Seventh International Conference on Networking (2008)

This paper introduces a clustering algorithm for applications running in backbone-assisted mobile ad hoc networks. The algorithm assigns weights both to the network nodes and to the communication links in order to elect local leaders, so called cluster heads.
Ensuring Progress in Amnesiac Replicated Systems
Authors: Rubén de Juan-Marín, Luis Irún-Briz, Francesc D. Muñoz-Escoí
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Replication is used for providing highly available and fault-tolerant information systems, which are constructed on top of replication and recovery protocols. Important aspects when designing these systems are the failure model assumed and the progress condition assumed. Replicated transactionalsystems usually assume the crash-recovery with partial amnesia failure model, and the majority partition progress condition. But, despite the large use of such combination most of these works do not handle accurately a very special phenomenon that can lead to diverging states in different replicas causing, when happening, critical situations.
Intelligent Dynamic Simulation of a Fed-Batch Enzyme Fermentation Process
Authors: Esko K. Juuso
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

This paper describes building of a dynamic simulation model for prediction of bioprocess variables. The simulator consists of three interacting dynamic model based on the method of linguistic equations. Each model has three versions, i.e. an own version for each phase of the fed-batch fermentation process. Steady state methods with dynamic structures were used in developing these linguistic equation models. With this simulator, it is possible to predict values of dissolved oxygen concentration, oxygen transfer rate and concentration of carbon dioxide in the exhaust gas through the whole process, using only the values of the control variables as inputs. Extension to fuzzy LE models provides useful information about uncertainties of the forecasted results. The complexity of the models is increased only slightly with the new system based on the extension principle and fuzzy interval analysis.
Two-Character Motion Analysis and Synthesis
Authors: Taesoo Kwon, Young-Sang Cho, Sang I Park, Sung Yong Shin
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

In this paper, we deal with the problem of synthesizing novel motions of standing-up martial arts such as Kickboxing, Karate, and Taekwondo performed by a pair of human-like characters while reflecting their interactions. Adopting an example-based paradigm, we address three non-trivial issues embedded in this problem: motion modeling, interaction modeling, and motion synthesis. For the first issue, we present a semi-automatic motion labeling scheme based on force-based motion segmentation and learning-based action classification. We also construct a pair of motion transition graphs each of which represents an individual motion stream. For the second issue, we propose a scheme for capturing the interactions between two players. A dynamic Bayesian network is adopted to build a motion transition model on top of the coupled motion transition graph that is constructed from an example motion stream. For the last issue, we provide a scheme for synthesizing a novel sequence of coupled motions, guided by the motion transition model. Although the focus of the present work is on martial arts, we believe that the framework of the proposed approach can be conveyed to other two-player motions as well.
On graphs whose Laplacian matrices have distinct integer eigenvalues
Authors: Shaun M. Fallat, Stephen J. Kirkland, Jason J. Molitierno, M. Neumann
Venue: Journal of Graph Theory (2005)

In this paper, we investigate graphs for which the corresponding Laplacian matrix has distinct integer eigenvalues. We define the set Si,n to be the set of all integers from 0 to n, excluding i. If there exists a graph whose Laplacian matrix has this set as its eigenvalues, we say that this set is Laplacian realizable. We investigate the sets Si,n that are Laplacian realizable, and the structures of the graphs whose Laplacian matrix has such a set as its eigenvalues. We characterize those i&thinsp;<&thinsp;n such that Si,n is Laplacian realizable, and show that for certain values of i, the set Si,n is realized by a unique graph. Finally, we conjecture that Sn,n is not Laplacian realizable for n&thinsp;&ge;&thinsp;2 and show that the conjecture holds for certain values of n. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
A simulated annealing approach to speaker segmentation in audio databases
Authors: José M. Leiva-Murillo, Sancho Salcedo-Sanz, Ascensión Gallardo-Antolín, Antonio Artés-Rodríguez
Venue: Engineering Applications of Artificial Intelligence (2008)

In this paper we present a novel approach to the problem of speaker segmentation, which is an unavoidable previous step to audio indexing. Mutual information is used for evaluating the accuracy of the segmentation, as a function to be maximized by a simulated annealing (SA) algorithm. We introduce a novel mutation operator for the SA, the Consecutive Bits Mutation operator, which improves the performance of the SA in this problem. We also use the so-called Compaction Factor, which allows the SA to operate in a reduced search space. Our algorithm has been tested in the segmentation of real audio databases, and it has been compared to several existing algorithms for speaker segmentation, obtaining very good results in the test problems considered.