The Effectiveness Of Virtual Team: An Empirical Investigation Of Manufacturing Industry In Penang Malaysia

Pasukan maya (virtual team) akan menjadi satu cara asas untuk menjalankan perniagaan demi organisasi terus bertanding dalam sekeliling global. Virtual teams had become a fundamental way to conduct business in order for organizations to remain competitive and sustain in a global environment

Pontryagin duality for Iwasawa modules and abelian varieties

We prove a functional equation for two projective systems of finite abelian $p$-groups, \{\fa_n\} and \{\fb_n\}, endowed with an action of \ZZ_p^d such that \fa_n can be identified with the Pontryagin dual of \fb_n for all $n$. Let $K$ be a global field. Let $L$ be a \ZZ_p^d-extension of $K$ ($d\geq 1$), unramified outside a finite set of places. Let $A$ be an abelian variety over $K$. We prove an algebraic functional equation for the Pontryagin dual of the Selmer group of $A$.Comment: 30 pages. arXiv admin note: substantial text overlap with arXiv:1205.594

On the Iwasawa Main conjecture of abelian varieties over function fields

We study a geometric analogue of the Iwasawa Main Conjecture for abelian varieties in the two following cases: constant ordinary abelian varieties over $Z_p^d$-extensions of function fields ($d\geq 1$) ramified at a finite set of places, and semistable abelian varieties over the arithmetic $Z_p$-extension of a function field. One of the tools we use in our proof is a pseudo-isomorphism relating the duals of the Selmer groups of $A$ and its dual abelian variety $A^t$. This holds as well over number fields and is a consequence of a quite general algebraic functional equation.Comment: 80 pages; many relevant changes all over the paper from v1. Among the most significant ones: new introduction; proof of the functional equation for Gamma systems in more cases and some applications to CM abelian varietie

On the Complexity of Implementing Certain Classes of Shared Objects

We consider shared memory systems in which asynchronous processes cooperate with each other by communicating via shared data objects, such as counters, queues, stacks, and priority queues. The common approach to implementing such shared objects is based on locking: To perform an operation on a shared object, a process obtains a lock, accesses the object, and then releases the lock. Locking, however, has several drawbacks, including convoying, priority inversion, and deadlocks. Furthermore, lock-based implementations are not fault-tolerant: if a process crashes while holding a lock, other processes can end up waiting forever for the lock. Wait-free linearizable implementations were conceived to overcome most of the above drawbacks of locking. A wait-free implementation guarantees that if a process repeatedly takes steps, then its operation on the implemented data object will eventually complete, regardless of whether other processes are slow, or fast, or have crashed. In this thesis, we first present an efficient wait-free linearizable implementation of a class of object types, called closed and closable types, and then prove time and space lower bounds on wait-free linearizable implementations of another class of object types, called perturbable types. (1) We present a wait-free linearizable implementation of n-process closed and closable types (such as swap, fetch&add, fetch&multiply, and fetch&L, where L is any of the boolean operations and, or, or complement) using registers that support load-link (LL) and store-conditional (SC) as base objects. The time complexity of the implementation grows linearly with contention, but is never more than O(log ^2 n). We believe that this is the first implementation of a class of types (as opposed to a specific type) to achieve a sub-linear time complexity. (2) We prove linear time and space lower bounds on the wait-free linearizable implementations of n-process perturbable types (such as increment, fetch&add, modulo k counter, LL/SC bit, k-valued compare&swap (for any k \u3e= n), single-writer snapshot) that use resettable consensus and historyless objects (such as registers that support read and write) as base objects. This improves on some previously known Omega(sqrt{n}) space complexity lower bounds. It also shows the near space optimality of some known wait-free linearizable implementations

The Iwasawa main conjecture for semistable abelian varieties over function fields

We prove the Iwasawa main conjecture over the arithmetic $\mathbb{Z}_p$-extension for semistable abelian varieties over function fields of characteristic $p>0$.Comment: arXiv admin note: substantial text overlap with arXiv:1205.594

Design, synthesis, conformational analysis and nucleic acid hybridisation properties of thymidyl pyrrolidine-amide oligonucleotide mimics (POM)

Pyrrolidine-amide oligonucleotide mimics (POM) 1 were designed to be stereochemically and conformationally similar to natural nucleic acids, but with an oppositely charged, cationic backbone. Molecular modelling reveals that the lowest energy conformation of a thymidyl-POM monomer is similar to the conformation adopted by ribonucleosides. An e cient solution phase synthesis of the thymidyl POM oligomers has been developed, using both N-alkylation and acylation coupling strategies. 1H NMR spectroscopy con rmed that the highly water soluble thymidyl-dimer, T2-POM, preferentially adopts both a con guration about the pyrrolidine N-atom and an overall conformation in D2O that are very similar to a typical C3 -endo nucleotide in RNA. In addition the nucleic acid hybridisation properties of a thymidyl-pentamer, T5-POM, with an N-terminal phthalimide group were evaluated using both UV spectroscopy and surface plasmon resonance (SPR). It was found that T5-POM exhibits very high a nity for complementary ssDNA and RNA, similar to that of a T5-PNA oligomer. SPR experiments also showed that T5-POM binds with high sequence delity to ssDNA under near physiological conditions. In addition, it was found possible to attenuate the binding a nity of T5-POM to ssDNA and RNA by varying both the ionic strength and pH. However, the most striking feature exhibited by T5-POM is an unprecedented kinetic binding selectivity for ssRNA over DNA

News Reliability Evaluation using Latent Semantic Analysis

The rapid rise and widespread of ‘Fake News’ has severe implications in the society today. Much efforts have been directed towards the development of methods to verify news reliability on the Internet in recent years. In this paper, an automated news reliability evaluation system was proposed. The system utilizes term several Natural Language Processing (NLP) techniques such as Term Frequency-Inverse Document Frequency (TF-IDF), Phrase Detection and Cosine Similarity in tandem with Latent Semantic Analysis (LSA). A collection of 9203 labelled articles from both reliable and unreliable sources were collected. This dataset was then applied random test-train split to create the training dataset and testing dataset. The final results obtained shows 81.87% for precision and 86.95% for recall with the accuracy being 73.33%